【122】. 买卖股票的最佳时机 II

链接点我

题目描述

思路

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