LeetCode 筆記 - 121. Best Time to Buy and Sell Stock

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        
        low_price = prices[0]
        high_price = 0
        
        result = 0
        for p in prices:
            
            if low_price > p:
                low_price = p
                high_price = p + result
            elif high_price < p:
                high_price = p
                
                result = max(result, high_price - low_price)

        return result