Leetcode--best time to Buy and Sell Stock II

Traverse the price vector, add up the profit for each period of the ascent, and remember to calculate the last profit at the end.

Class Solution {    //Add up profit for each period of ascent    //Minval: Trough value    //maxval: Peak    //Profit: Profit public:    int Maxprofit ( Vector<int> &prices) {        if (Prices.empty ()) return 0;        int maxval (prices[0]), Minval (Prices[0]), profit (0);        for (int i = 0; I! = Prices.size (); i + +) {            //If down, sell stock: if prices[i] > maxval, then Drop            if (Prices[i] < maxval) {
   
    profit + = Maxval-minval;                Minval = Maxval = Prices[i];            }            If up, change the peak            else{                maxval = prices[i];            }        }        Finally calculate the profit again, if Maxval-minval > 0, then add profit        if (Maxval-minval > 0) Profit + = Maxval-minval;        return profit;}            ;
   

Leetcode--best time to Buy and Sell Stock II