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

package leetcode;

public class demo_122 {
    public int maxProfit(int[] prices) {
        if(prices.length==0) {return 0;}
        int sumprofit=0;
        //允许当天卖完后在买，所以贪心算法只要今天比昨天的价格高就卖出去
        for(int i=1;i<prices.length;i++) {
            if(prices[i]>prices[i-1]) {
                sumprofit=sumprofit+prices[i]-prices[i-1];
            }
        }
        System.out.println(sumprofit);
        return sumprofit;
    }
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        demo_122 d122 = new demo_122();
        int[] prices= {7,1,5,3,6,4};
        d122.maxProfit(prices);
    }

}