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

Problem 188: Best Time to Buy and Sell Stock IV [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 k transactions.

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

Example 1:

Input: [2,4,1], k = 2
Output: 2
Explanation: Buy on day 1 (price = 2) and sell on day 2 (price = 4), profit = 4-2 = 2.

Example 2:

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

来源：LeetCode

解题思路

本题需要使用动态规划思想。与题解123：Best Time to Buy and Sell Stock III同属于最佳时机买卖股票问题。

解题思路选用[题解123]中的方法III，123题中是最多可以交易2次，复杂度为$O(n)$时间+$O(4)$空间，本题中最多可以交易k次，所以复杂度为$O(n)$时间+$O(2k)$空间。
在一次循环中，可以使用k组{minCost_j, maxP_j}，先计算第一轮的{minCost₁, maxP₁}，再计算第二轮的{minCost₂, maxP₂}，…，最后计算第k轮的{minCost_k, maxP_k}。

更新公式为：
$$cpc{p}_0=\left[\begin{array}{c}prices[0]\\ 0\\ prices[0]\\ 0\\ ...\\ prices[0]\\ 0\end{array}\right]$$
c p c p = [ { min ⁡ { c p c p [ 0 ] , p r i c e s [ i ] } max ⁡ { c p c p [ 1 ] , p r i c e s [ i ] − c p c p [ 0 ] } . . . min ⁡ { c p c p [ 2 ∗ j ] , p r i c e s [ i ] − c p c p [ 2 ∗ j − 1 ] } max ⁡ { c p c p [ 2 ∗ j + 1 ] , p r i c e s [ i ] − c p c p [ 2 ∗ j ] } . . .