188.买卖股票的最佳时机IV
leetcode 188.买卖股票的最佳时机IV
代码随想录
class Solution:
def maxProfit(self, k: int, prices: List[int]) -> int:
if len(prices) == 1:
return 0
dp = [[0] * (2*k+1) for _ in range(len(prices))]
# 奇数持有股票,偶数不持有股票
# 和昨天的允许两次卖出差不多。
for i in range(k):
dp[0][2*i+1] = -prices[0]
for i in range(1, len(prices)):
dp[i][0] = dp[i-1][0]
for j in range(k):
dp[i][2*j+1] = max(dp[i-1][2*j+1], dp[i-1][2*j]-prices[i])
dp[i][2*j+2] = max(dp[i-1][2*j+2], dp[i-1][2*j+1] + prices[i])
return dp[-1][-1]
309.最佳买卖股票时机含冷冻期
leetcode 309.最佳买卖股票时机含冷冻期
代码随想录
class Solution:
def maxProfit(self, prices: List[int]) -> int:
if len(prices) == 1:
return 0
dp = [[0]*4 for _ in range(len(prices))]
# a 持有:前一天持有、不持有-买入,冷冻期-买入
# b 不持有:前一天卖出(来源前一天不持有,或者冷冻期); 今天卖出(2)、
# c 冷冻
dp[0][0] = -prices[0]
for i in range(1, len(prices)):
dp[i][0] = max(dp[i-1][0], max(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[-1][1], max(dp[-1][2], dp[-1][3]))
714.买卖股票的最佳时机含手续费
leetcode 714.买卖股票的最佳时机含手续费
代码随想录
class Solution:
def maxProfit(self, prices: List[int], fee: int) -> int:
# 需要二维数组来记录
# [0]持有股票和[1]不持有股票
if len(prices) == 0:
return 0
dp = [[0,0] for _ in range(len(prices))]
dp[0][0] = -prices[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][1], dp[i-1][0] + prices[i] - fee)
return max(dp[-1][0], dp[-1][1])