leetcode122. 买卖股票的最佳时机 II

class Solution {
    
    
    

    public int maxProfit(int[] prices) {
        
        int ans = 0;
        for (int i = 0; i < prices.length-1; i++) {
            int nums = prices[i+1] - prices[i];
            if (nums > 0) ans += nums;
        }

        return ans;
    }
}