121买卖股票的最佳时机
class Solution:
def maxProfit(self, prices: List[int]) -> int:
if len(prices) == 1:
return 0
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], -prices[i])
dp[i][1] = max(dp[i - 1][1], dp[i - 1][0] + prices[i])
return max(dp[len(prices) - 1][0], dp[len(prices) - 1][1])
122买卖股票的最佳时机II
class Solution:
def maxProfit(self, prices: List[int]) -> int:
if len(prices) == 1:
return 0
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][1], dp[i - 1][0] + prices[i])
return max(dp[len(prices) - 1][0], dp[len(prices) - 1][1])