2020年3月9日
[LC] 123. Best Time to Buy and Sell Stock III
摘要： 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 @ 2020-03-09 20:53 xuan_abc 阅读(126) 评论(0) 推荐(0)
[LintCode] 1563. Shortest path to the destination
摘要： Given a 2D array representing the coordinates on the map, there are only values 0, 1, 2 on the map. value 0 means that it can pass, value 1 means not 阅读全文
posted @ 2020-03-09 04:37 xuan_abc 阅读(254) 评论(0) 推荐(0)