| | | | |

2016年11月2日

leetcode 122. Best Time to Buy and Sell Stock II ----- java

摘要： Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may comple 阅读全文

posted @ 2016-11-02 17:37 xiaoba1203 阅读(210) 评论(0) 推荐(0)

leetcode 121. Best Time to Buy and Sell Stock ----- java

摘要： 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 @ 2016-11-02 17:11 xiaoba1203 阅读(142) 评论(0) 推荐(0)

leetcode 120 Triangle ----- java

摘要： 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 @ 2016-11-02 16:37 xiaoba1203 阅读(364) 评论(0) 推荐(0)

2016年11月2日

公告