Leetcode best time to Buy and Sell Stock

There is an array of prices, the corresponding position represents the price of the other day stock, you have a chance to buy and sell, how you make the profit maximization. That is to return to profit.

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.

Actually sweep the array, record to the current minimum value, and then the current value minus the minimum value and profit contrast, large presence profit inside, and finally return to profit on the line

classSolution { Public:    intMaxprofit (vector<int> &prices) {        if(prices.size () = =0)return 0; intProfit =0, MINP = prices[0];  for(inti =1; I < prices.size (); ++i) {if(Prices[i]-MINP >profit) Profit= Prices[i]-MINP; if(Prices[i] <minp) Minp=Prices[i]; }        returnprofit; }};

Leetcode best time to Buy and Sell Stock