LeetCode
「已注销」
这个作者很懒,什么都没留下…
展开
-
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 leaf node.原创 2014-11-11 12:43:36 · 275 阅读 · 1 评论 -
Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value.原创 2014-11-18 13:36:56 · 276 阅读 · 0 评论 -
Reverse Integer
Reverse digits of an integer. //反转数字的值 Example1: x = 123, return 321 Example2: x = -123, return -321 Here are some good questions to ask before coding. Bonus points for you if yo原创 2014-11-03 00:29:51 · 211 阅读 · 0 评论 -
Symmetric Tree
Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center). For example, this binary tree is symmetric: 1 / \ 2 2 / \ / \ 3 4 4 3 But the following原创 2014-11-25 16:45:38 · 279 阅读 · 0 评论 -
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 does not exist, return 0. Note: A word is defi原创 2014-11-08 17:48:55 · 250 阅读 · 0 评论