[Vssue]0188.买卖股票的最佳时机IV.md

[youngyangyang04]

https://www.programmercarl.com/0188.%E4%B9%B0%E5%8D%96%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E4%BD%B3%E6%97%B6%E6%9C%BAIV.html

[Du1in9]

int[][] dp = new int[prices.length][2 * k + 1];

for (int j = 1; j < 2 * k + 1; j += 2) {
    dp[0][j] = -prices[0];
}
for (int i = 1; i < prices.length; i++) {
    for (int j = 1; j < 2 * k + 1; j += 2) {
        dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1] - prices[i]);
        dp[i][j + 1] = Math.max(dp[i - 1][j + 1], dp[i][j] + prices[i]);
    }
}
return dp[prices.length - 1][2 * k];