class Solution:
def maxProfit(self , prices: List[int]) -> int:
i=0
min_price=prices[0]
min_price_i=0
max_lirun=prices[0]-min_price
while i<=len(prices)-1:
if prices[i]<min_price:
min_price=prices[i]
if prices[i]-min_price>max_lirun:
max_lirun=prices[i]-min_price
i=i+1
return max_lirun
NC7 买卖股票的最好时机(Python3)
最新推荐文章于 2024-05-19 23:31:32 发布