2018年4月8日
121. Best Time to Buy and Sell Stock（股票最大收益）
摘要： 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 @ 2018-04-08 10:48 乐乐章 阅读(195) 评论(0) 推荐(0)
120. Triangle(动态规划 三角形最小路径 难 想)
摘要： Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given the fo 阅读全文
posted @ 2018-04-08 10:15 乐乐章 阅读(269) 评论(0) 推荐(0)