LeetCode - Best Time to Buy and Sell Stock II

class Solution {
public:
    int maxProfit(vector<int>& prices) {
        if(prices.size()<=1) return 0;
        int res = 0;
        for(int i=1;i<prices.size();i++){
            if(prices[i-1]<prices[i]){
                res += prices[i]-prices[i-1];
            }
        }
        return res;
    }
};