yys130826的博客

class Solution: def maxProfit(self, prices: List[int]) -> int: dp=[[0 for _ in range(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],-.