[Leetcode/Python3] 121. Best Time to Buy and Sell Stock

Code

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        minv = prices[0]
        res = 0
        for x in prices[1:]:
            minv = min(minv, x)
            res = max(x - minv, res)
        return res

---

Result

Runtime: 1088 ms

Memory Usage: 25.2 MB