LeetCode 122. Best Time to Buy and Sell Stock II解答

public int maxProfit(int[] prices) {
        int profit=0;
        int buy=-1,sell=-1;

        if(prices.length==0){
            return 0;
        }
        for(int i=0;iprices[i+1])&&buy!=-1){
                sell=prices[i];
                profit+=sell-buy;
                buy=-1;
                continue;
            }
        
        }
        return profit;
    }

class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length <= 1) {
            return 0;
        }
        int pp = 0, p = 0, result = 0;
        for (int i = 1; i < prices.length; i++) {
            if (prices[i] > prices[i-1]) {
                result += prices[i] - prices[i-1];
            }
        }
        return result;
    }
}