【LeetCode】解题123：Best Time to Buy and Sell Stock III（动态规划）

Problem 123: Best Time to Buy and Sell Stock III [Hard]

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 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.

来源：LeetCode

解题思路

本题需要使用动态规划思想。

I. O(2n)时间+O(3n)空间

最常规的DP思想是使用maxP[N][3]来存储最大利润，其中maxP[i][k]是指在第k次循环中，第i天的最大利润。k的范围由总交易次数决定，本题中能够交易两次，因此k为0~2。
每轮循环k的更新公式为：
m i n C o s t 0 = p r i c e s [ 0 ] m i n C o s t = min ⁡ { m i n C o s t , p r i c e s [ i ] − m a x P [ i − 1 ] [ k − 1 ] } m a x P [ i ] [ k ] = max ⁡ { m a x P [ i − 1 ] [ k ] , p r i c e s [ i ] − m i n C o s t } i ∈ [ 1 , N − 1 ] , k ∈ [ 1 , 2 ] minCost_0 = prices[0]\\ minCost = \min\{minCost, prices[i] - maxP[i-1][k-1]\}\\ maxP[i][k] = \max\{maxP[i-1][k], prices[i] - minCost\}\\ i\in[1,N-1], k\in[1,2] minCost0​=prices[0]minCost=min{ minCost,prices[i]−maxP[i−1][k−1]}maxP[i][k]=max{ maxP[i−1][k],prices[i]−minCost}i∈[1,N−1],k∈[1,2]
其中$minCost$代表当前最低成本， p r i c e s [ i ] − m a x P [ i − 1 ] [ k −