Java for LeetCode 122 Best Time to Buy and Sell Stock 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).

解题思路：

仿照上题，如果遍历中出现下降，即卖掉同时将buy设置为下降点，JAVA实现如下：

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