leetcode-123 Best Time to Buy and Sell Stock III

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 at most two transactions.

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: [3,3,5,0,0,3,1,4]
Output: 6
Explanation: Buy on day 4 (price = 0) and sell on day 6 (price = 3), profit = 3-0 = 3.
             Then buy on day 7 (price = 1) and sell on day 8 (price = 4), profit = 4-1 = 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.

 

本题运用了动态规划，用res[i][j]表示 i在j处或之前已经进行交易了i次，j表示当前所在的天数，改天可以进行交易卖出，也可以是什么都不做。

故当i和j大于0的时候res[i][j] = Math.max(res[i][j-1],res[i-1][k-1]+price[j]-price[k]);

其中k表示上一次进行购买的天数位置，将 res[i-1][k-1]-price[k]提出为参数price那么price为每次j进行数据获取后，j天后进行购买的price = Math.max(res[i-1][j-1]-prices[j],price);

故解题如下：

    public int maxProfit(int[] prices) {
        if(prices == null || prices.length <=1) {
            return 0;
        }
        int res[][] = new int[3][prices.length];
        for(int i=1;i<=2;i++) {
            int price = -prices[0];
            for(int j=1;j<prices.length;j++) {
                res[i][j] = Math.max(res[i][j-1], prices[j]+price);
                price = Math.max(res[i-1][j-1]-prices[j],price);
                
            }
            
        }
        return res[2][prices.length-1];
        
    }