LeetCode.121 买卖股票的最佳时机
dp0, dp1 = -prices[0], 0
for i in range(len(prices)):
dp0 = max(dp0, -prices[i])
dp1 = max(dp1, dp0+prices[i])
return dp1
LeetCode.122 买卖股票的最佳时机II
dp0, dp1 = 0, -prices[0]
for i in range(1, len(prices)):
dp0 = max(dp1+prices[i], dp0)
dp1 = max(dp1, dp0-prices[i])
return dp0