Best Time to Buy and Sell Stock II

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        int answer = 0, minPrice = prices[0];
        for (int i = 1; i < prices.size(); i++) {
            if (prices[i-1] > prices[i]) {
                // sequence stopped increasing
                answer += (prices[i-1] - minPrice);
                minPrice = prices[i];
            }
        }
        return answer + (prices[prices.size()-1] - minPrice);
    }
};