2015年8月4日
[LeetCode] Binary Tree Maximum Path Sum
摘要： A relatively difficult tree problem. Well, a recursive solution still gives clean codes. The tricky part of this problem is how to record the result. ... 阅读全文
posted @ 2015-08-04 21:52 jianchao-li 阅读(238) 评论(0) 推荐(0)
[LeetCode] Best Time to Buy and Sell Stock IV
摘要： An extension of Best Time to Buy and Sell Stock III. The idea is still to use dynamic programming (see here for detailed introduction). However, in th... 阅读全文
posted @ 2015-08-04 17:23 jianchao-li 阅读(228) 评论(0) 推荐(0)