#123 Best Time to Buy and Sell Stock III

Description

You are given an array prices where prices[i] is the price of a given stock on the ith day.

Find the maximum profit you can achieve. You may complete at most two transactions.

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

Examples

Example 1:

Input: prices = [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: prices = [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: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transaction is done, i.e. max profit = 0.

Constraints:

1 <= prices.length <= $10^5$
0 <= prices[i] <= $10^5$

思路

这里是说在最多只能交易两次的情况下，怎么利益最大化，这里可以推广到交易k次的情况，我自己其实没有想出来，但是根据答案做倒推，最终我们能得到的profit应该是
price[second_sell] - price[second_buy] + price[first_sell] - price[first_buy]
可以根据阶段把数据划分为
buy1 = price[first_buy]
sell1 = price[first_sell] - buy1
buy2 = price[second_buy] - sell1
sell2 = price[second_sell] - buy2
根据profit，不难发现，我们需要得到的是
min(buy1), min(buy2)
max(sell1), max(sell2)
那之后的推论就很便捷了，大家都是和自身相比较，可以看代码里的循环内操作

代码

class Solution {
    public int maxProfit(int[] prices) {
        int buy1, buy2, sell1, sell2;
        sell1 = 0;
        sell2 = 0;
        buy1 = Integer.MAX_VALUE;
        buy2 = Integer.MAX_VALUE;
        
        for (int price: prices) {
            buy1 = Math.min(buy1, price);
            sell1 = Math.max(sell1, price - buy1);
            
            buy2 = Math.min(buy2, price - sell1);
            sell2 = Math.max(sell2, price - buy2);
        }
        
        return sell2;
    }
}