188. 买卖股票的最佳时机 IV

class Solution:
    def maxProfit(self, k: int, prices: List[int]) -> int:
        n = len(prices)
        #dp[i][j][0]第i天第j次持有；dp[i][j][1]第i天第j次不持有（i:0->n-1）(k:1->k)
        dp = [[[0]*2 for _ in range(k+1)] for _ in range(n)]
        for j in range(1,k+1):
            dp[0][j][0] = -prices[0]
        
        #先遍历天数，再遍历次数
        for i in range(1,n):
            for j in range(1,k+1):
                #前一天就已经第k次持有,前一天第k-1次不持有
                dp[i][j][0] = max(dp[i-1][j][0],dp[i-1][j-1][1]-prices[i])
                #前一天第k次不持有，前一天第k次持有
                dp[i][j][1] = max(dp[i-1][j][1],dp[i-1][j][0]+prices[i])
        return dp[n-1][k][1]