【leetcode】买卖股票的最佳时机

简洁的写法

class Solution(object):
    def maxProfit(self, prices):
        """
        :type prices: List[int]
        :rtype: int
        """
        
        inf = int(1e9)
        minprice = inf
        maxprofit = 0
        for price in prices:
            maxprofit = max(price - minprice, maxprofit)
            minprice = min(price, minprice)
        return maxprofit

另一种代码写法

min_price = 10**9
        max_reward = -10**9
        for price in prices:
            if price<min_price:
                min_price = price
                continue
            if price-min_price > max_reward:
                max_reward = price-min_price
        if max_reward==-10**9:
            return 0
        else:
            return max_reward