【Java】【LeetCode】122. Best Time to Buy and Sell Stock II

题目：

Say you have an array for which the ith 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 (i.e., buy one and sell one share of the stock multiple times).

Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again).

Example 1:

Input: [7,1,5,3,6,4]
Output: 7
Explanation: Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4.
             Then buy on day 4 (price = 3) and sell on day 5 (price = 6), profit = 6-3 = 3.

Example 2:

Input: [1,2,3,4,5]
Output: 4
Explanation: Buy on day 1 (price = 1) and sell on day 5 (price = 5), profit = 5-1 = 4.
             Note that you cannot buy on day 1, buy on day 2 and sell them later, as you are
             engaging multiple transactions at the same time. You must sell before buying again.

Example 3:

Input: [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

题解：

找到递减的局部最低点，再找到递增的局部最高点，算一次加和，然后再这么找。

代码如下：

public class BestTimetoBuyandSellStockII {

    public static void main(String[] args) {
        /**
         * Say you have an array for which the ith 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 (i.e., buy one and sell one share of the stock
         * multiple times).
         * 
         * Note: You may not engage in multiple transactions at the same time (i.e., you
         * must sell the stock before you buy again).
         * 
         * Example 1:
         * 
         * Input: [7,1,5,3,6,4] Output: 7 Explanation: Buy on day 2 (price = 1) and sell
         * on day 3 (price = 5), profit = 5-1 = 4. Then buy on day 4 (price = 3) and
         * sell on day 5 (price = 6), profit = 6-3 = 3. Example 2:
         * 
         * Input: [1,2,3,4,5] Output: 4 Explanation: Buy on day 1 (price = 1) and sell
         * on day 5 (price = 5), profit = 5-1 = 4. Note that you cannot buy on day 1,
         * buy on day 2 and sell them later, as you are engaging multiple transactions
         * at the same time. You must sell before buying again. Example 3:
         * 
         * Input: [7,6,4,3,1] Output: 0 Explanation: In this case, no transaction is
         * done, i.e. max profit = 0.
         */
        System.out.println(maxProfit(new int[] { 7, 1, 5, 3, 6, 4 }));
        System.out.println(maxProfit(new int[] { 1, 2, 3, 4, 5 }));
        System.out.println(maxProfit(new int[] { 7, 6, 4, 3, 1 }));
    }

    public static int maxProfit(int[] prices) {
        if (prices == null || prices.length <= 1) {
            return 0;
        }
        int buy = 0, i = 0, len = prices.length, profit = 0, sell = 0;
        while (i + 1 < len) {
            // 寻找递减区间的最后一个值（局部最小点）
            while (i + 1 < len && prices[i + 1] <= prices[i]) {
                i++;
            }
            // 局部最小点作为买入点
            buy = i++;
            // 寻找递增区间的最后一个值（局部最高点）
            while (i + 1 < len && prices[i + 1] >= prices[i]) {
                i++;
            }
            // 设置卖出点
            sell = i++;
            // 计算总和
            if (i < len ) {
                profit += prices[sell] - prices[buy];
            }
            
        }
        return profit;
    }
}