[Leetcode] best time to Buy and Sell Stock

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.

Problem Solving Ideas:

Test instructions is the price of a given stock at each point in time, and the stipulation can only be bought and sold once, asking what is the most money that can be earned.

Record the smallest stock price so far, then the difference between the current share price and the current minimum price is greater than the current maximum profit, then the maximum profit can be updated.

Class Solution {public:    int Maxprofit (vector<int>& prices) {        int len = Prices.size ();        if (len==0 | | len==1) {            return 0;        }        int maxprofit = 0;        int minprices = prices[0];        for (int i=1; i<len; i++) {            minprices = min (minprices, prices[i]);            Maxprofit = Max (Maxprofit, Prices[i]-minprices);        }        return maxprofit;}    ;

Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

[Leetcode] best time to Buy and Sell Stock