leetcode
文章平均质量分 82
lisendong0126
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
[leetcode]Best Time to Buy and Sell Stock I, II, III
这三道与股票相关的题目很有意思,有一些常用的小tricky和代码简洁技巧都用到了。 第一题 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 transacti原创 2014-01-23 16:20:16 · 1223 阅读 · 0 评论 -
[leetcode]Binary Tree Maximum Path Sum
原题目: Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example: Given the below binary tree, 1 / \ 2 3 Return 6.原创 2014-01-23 00:39:34 · 1336 阅读 · 0 评论
分享