贪心算法---The best time to buy and sell store-ii

Say you have an array for which the i th element is the price of a given stock on day i.

Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy one and sell one share of the stock multiple times). However, you may not engage in multiple transactions at the same time (ie, you must sell the stock before you buy again).

public class Solution {
    public int maxProfit(int[] prices) {
        int sum = 0;
        if(prices.length <= 1)
            return 0;
        for(int i=0; i < prices.length-1 ; i++){
            if(prices[i+1] > prices[i]){
            int y = prices[i+1] - prices[i];
            sum = sum + y;
            }
        }
        if(sum<0)
            return 0;
        else
            return sum;
    }
}