SONG Shengjie
List: 188.买卖股票的最佳时机IV，309.最佳买卖股票时机含冷冻期，714.买卖股票的最佳时机含手续费，股票总结
188.买卖股票的最佳时机IVbest-time-to-buy-and-sell-stock-iv，309.最佳买卖股票时机含冷冻期best-time-to-buy-and-sell-stock-with-cooldown，714.买卖股票的最佳时机含手续费best-time-to-buy-and-sell-stock-with-transaction-fee，股票总结
188.买卖股票的最佳时机IVbest-time-to-buy-and-sell-stock-iv
class Solution:
def maxProfit(self, k: int, prices: List[int]) -> int:
dp = [[0] * (2 * k + 1) for _ in range(len(prices))]
for j in range(1, 2 * k, 2):
dp[0][j] = - prices[0]
for i in range(1, len(prices)):
for j in range(0, 2 * k, 2):
dp[i][j + 1] = max(dp[i - 1][j + 1], dp[i - 1][j] - prices[i])
dp[i][j + 2] = max(dp[i - 1][j + 2], dp[i - 1][j + 1] + prices[i])
return dp[len(prices) - 1][2 * k]
309.最佳买卖股票时机含冷冻期best-time-to-buy-and-sell-stock-with-cooldown
class Solution:
def maxProfit(self, prices: List[int]) -> int:
dp = [[0] * 4 for i in range(len(prices))]
dp[0][0] = -prices[0]
dp[0][1] = 0
dp[0][2] = 0
dp[0][3] = 0
for i in range(1, len(prices)):
dp[i][0] = max(dp[i - 1][0], dp[i - 1][3] - prices[i], dp[i - 1][1] - prices[i])
dp[i][1] = max(dp[i - 1][1], dp[i - 1][3])
dp[i][2] = dp[i - 1][0] + prices[i]
dp[i][3] = dp[i - 1][2]
return max(dp[len(prices) - 1][1], dp[len(prices) - 1][2], dp[len(prices) - 1][3])
714.买卖股票的最佳时机含手续费best-time-to-buy-and-sell-stock-with-transaction-fee
class Solution:
def maxProfit(self, prices: List[int], fee: int) -> int:
dp = [[0] * 2 for _ in range(len(prices))]
dp[0][0] = -prices[0]
dp[0][1] = 0
for i in range(1, len(prices)):
dp[i][0] = max(dp[i - 1][0], dp[i - 1][1] - prices[i])
dp[i][1] = max(dp[i - 1][0] + prices[i] - fee, dp[i - 1][1])
return max(dp[len(prices) - 1][0], dp[len(prices) - 1][1])
总结
