[Leetcode] Best time to Buy Stock

Consider that the price of a stock is constantly changing, and selling can only be done after buying. and can only buy and sell once.

I want to sweep it at the beginning and ask for the smallest, but certainly not so simple. you're 484 stupid .

Because it can only be sold once, if I sell, the possible profit value is, Prices[i]-min, is today's price.

Comparing this value to the previous possible maximum, you can get the maximum possible value for the first day.

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

　　

[Leetcode] Best time to Buy Stock