LeetCode 122. Best Time to Buy and Sell Stock II

原题链接

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