摘要: Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction 阅读全文
posted @ 2015-02-08 16:12 Grandyang 阅读(23207) 评论(1) 推荐(1)
摘要: Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some starting node to any 阅读全文
posted @ 2015-02-08 15:55 Grandyang 阅读(25677) 评论(11) 推荐(3)
Fork me on GitHub