2017年12月10日
121. Best Time to Buy and Sell Stock买卖股票12
摘要： 一 ［抄题］： If you were only permitted to complete at most one transaction (ie, buy one and sell one share of the stock), design an algorithm to find the 阅读全文
posted @ 2017-12-10 16:07 苗妙苗 阅读(222) 评论(0) 推荐(0)
53. Maximum Subarray最大求和子数组12 3（dp）
摘要： ［抄题］： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [-2,1,-3,4 阅读全文
posted @ 2017-12-10 08:59 苗妙苗 阅读(232) 评论(0) 推荐(0)