2014年5月7日

【LeetCode OJ】Triangle

摘要： Problem Link:http://oj.leetcode.com/problems/triangle/Let R[][] be a 2D array where R[i][j] (j <= i) is the minimum sum of the path from triangle[0][0... 阅读全文

posted @ 2014-05-07 04:29 卢泽尔 阅读(160) 评论(0) 推荐(0)

【LeetCode OJ】Best Time to Buy and Sell Stock III

摘要： Problem Link:http://oj.leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/Linear Time SolutionWe try to solve this problem in O(n) time in the ... 阅读全文

posted @ 2014-05-07 01:21 卢泽尔 阅读(155) 评论(0) 推荐(0)