leetcode 121. 买卖股票的时机 python

题目描述：

题解：

第i天卖出可获取的最大利益=prices[i]-min，min为前i-1天的最低价格

1.buy记录前i-1天最低价格，初始化为prices[0]，earn记录最大利润，初始化为-1。

2.从prices[1]开始遍历prices，earn=max(earn,prices[i]-buy)  buy=min(buy,prices[i])

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        buy = prices[0]
        earn = -1
        for i in range(len(prices)):
            earn = max(earn,prices[i]-buy)
            buy = min(buy,prices[i])
        return earn