[LeetCode] Maximum Subarray 解题报告

摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [−2,1,−3,4,−1,2,1... 阅读全文
posted @ 2012-12-26 11:04 小刀初试 阅读(161) 评论(0) 推荐(0)

[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 le... 阅读全文
posted @ 2012-12-26 08:41 小刀初试 阅读(96) 评论(0) 推荐(0)