leetcode
文章平均质量分 78
零零我
意志不坚定慢慢熬
展开
-
[leetcode]Binary Tree Maximum Path Sum
近期为了准备笔试开始刷leetcode,记录一下希望自己可以坚持!Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:原创 2015-06-26 17:13:43 · 533 阅读 · 0 评论 -
[leetcode 111] Minimum Depth of Binary Tree
题目要求:Minimum Depth of Binary TreeGiven a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest原创 2015-06-28 21:05:25 · 392 阅读 · 0 评论