方法一:动态规划
class Solution:
def maxProfit(self, prices: List[int]) -> int:
#动态规划
n = len(prices)
if n == 0: return 0
dp = [0] * n
minprice = prices[0]
for i in range(1,n):
minprice = min(prices[i],minprice)
dp[i] = max(dp[i - 1], prices[i] - minprice)
return dp[-1]
方法二:动态规划改进
class Solution:
def maxProfit(self, prices: List[int]) -> int:
minprofit = float('inf')
maxprofit = 0
for price in prices:
minprofit = min(price, minprofit)
maxprofit = max(price - minprofit, maxprofit)
return maxprofit