lpomeloz

2019年6月7日

letecode [104] - Maximum Depth of Binary Tree

摘要： Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest l 阅读全文

posted @ 2019-06-07 18:33 lpomeloz 阅读(90) 评论(0) 推荐(0) 编辑

letecode [101] - Symmetric Tree

摘要： Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree [1,2,2,3,4,4,3] is symmet 阅读全文

posted @ 2019-06-07 17:05 lpomeloz 阅读(116) 评论(0) 推荐(0) 编辑

2019年6月6日

letecode [100] - Same Tree

摘要： Given two binary trees, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally ident 阅读全文

posted @ 2019-06-06 18:46 lpomeloz 阅读(145) 评论(0) 推荐(0) 编辑

letecode [88] - Merge Sorted Array

摘要： Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: The number of elements initialized in nums1 and num 阅读全文

posted @ 2019-06-06 15:49 lpomeloz 阅读(108) 评论(0) 推荐(0) 编辑

letecode [83] - Remove Duplicates from Sorted List

摘要： Given a sorted linked list, delete all duplicates such that each element appear only once. Example 1: Example 2: 题目大意：给定排序链表，删除其中重复的元素。理解：遍历链表，cu 阅读全文

posted @ 2019-06-06 12:47 lpomeloz 阅读(147) 评论(0) 推荐(0) 编辑

letecode [70] - Climbing Stairs

摘要： You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you cl 阅读全文

posted @ 2019-06-06 10:39 lpomeloz 阅读(125) 评论(0) 推荐(0) 编辑

letecode [69] - Sqrt(x)

摘要： Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return type is an in 阅读全文

posted @ 2019-06-06 09:06 lpomeloz 阅读(135) 评论(0) 推荐(0) 编辑

2019年6月5日

letecode [67] - Add Binary

摘要： Given two binary strings, return their sum (also a binary string). The input strings are both non-empty and contains only characters 1 or 0. Example 1 阅读全文

posted @ 2019-06-05 22:54 lpomeloz 阅读(159) 评论(0) 推荐(0) 编辑

2019年6月4日

letecode [66] - Plus One

摘要： Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant d 阅读全文

posted @ 2019-06-04 13:08 lpomeloz 阅读(165) 评论(0) 推荐(0) 编辑

letecode [58] - Length of Last Word

摘要： Given a string s consists of upper/lower-case alphabets and empty space characters ' ', return the length of last word in the string. If the last word 阅读全文

posted @ 2019-06-04 10:59 lpomeloz 阅读(132) 评论(0) 推荐(0) 编辑

公告