leetcode

class :
    def maxProfit(self, prices: List[int]) -> int:
        l = 0
        res  = 0;
        for i in range(1, len(prices)):
            profit = prices[i] - prices[l]
            if profit > res:
                res = profit
            if prices[i] < prices[l]:
                l = i
        return res
    

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