"Leetcode" 121.Best time to Buy and Sell Stock

Say you has an array for which the i-th element is the price of a given-stock on day I.

If you were-permitted-to-complete at most one transaction (ie, buy one and sell one share of the stock), design an AL Gorithm to find the maximum profit.

Topic Analysis:

When doing, want to use dynamic planning to do, at that time do not write a better expression of the recursive style. Because there is a relationship between the maximum value and the minimum value: When the maximum value is fixed at a certain moment, if you want to move the minimum value again, the maximum value is changed, and if the maximum value is changed, the minimum value will not be affected. This is more confusing than it looks.

Change of thinking: from backward to forward, to subscript I, then the first day to buy, so that the maximum profit is i+1 days ~n-1 fill the maximum price minus the first day.

1 classSolution {2  Public:3     intMaxprofit (vector<int>&prices) {4         //if (0 = = Prices.size ()) return 0;5         intLength =prices.size ();6         intresult =0;7         intMaxprice =result;8          for(inti = length-1; I >=0; --i)9         {TenMaxprice =Max (Maxprice, prices[i]); Oneresult = Max (result, Maxprice-prices[i]); A         } -         returnresult; -     } the};

198/198 Test cases passed.	status:accepted
Runtime:11 ms	Submitted:0 minutes ago

"Leetcode" 121.Best time to Buy and Sell Stock