超过时间限制的解法
一次遍历方法动态规划
def maxProfit(self, prices: List[int]) -> int:
current_max = 0
current_min = 1e9
for price in prices :
current_max = max(current_max,price-current_min)
current_min = min(current_min,price)
return current_max