Best Time to Buy and Sell Stock II [Leetcode]

Say you have an array for which the i^th element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

Solution: find out all increasing consecutive subsequence S's; buy stock at the beginning of S and sell it at the end of the S.

class Solution {
public:
    int maxProfit(vector<int> &prices) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(prices.empty()) return 0;
        
        int sumProfit = 0;
        int minCur = prices[0];
        for(int i=1; i<prices.size(); ++i){
            if(prices[i]<prices[i-1]){
                sumProfit+=(prices[i-1]-minCur);
                minCur = prices[i];
            }
        }
        if(prices.back()>minCur)
            sumProfit += prices.back()-minCur;
        return sumProfit;
    }
};