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

?代码随想录

class Solution {

    public int maxProfit(int[] prices) {
        int [] temp = new int[prices.length-1];

        for(int i = 0; i  < prices.length-1; i ++){
            temp[i] = prices[i+1] - prices[i];
        }

        int sum = 0;
        for(int i = 0 ; i < temp.length ; i ++){
            if(temp[i] > 0){
                sum += temp[i];
            }
        }
        return sum;
    }
}