122. Best Time to Buy and Sell Stock II

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        //这道题我想的太复杂了，其实就是从头开始，只要后项大于前项就把数据加入到结果中，
        //多次交易的累和，只能向后计算
        //贪心算法
        int len = prices.size();
        int res = 0;
        int diff = 0;
        for(int  i = 1 ; i < len ; i++){
            diff = prices[i] - prices[i-1];
            if(diff > 0){
                res+=diff; 
            }
        }
        return res;
    }
};