LeetCode（初级算法）数组篇--买卖股票的最佳时机 II c++

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