Method maxProfit

121 Leetcode/121 leetcode.py:2–10

(self, prices: List[int])

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        maxProfit = 0
        currentMax = 0

        for i in reversed(prices):
            currentMax = max(currentMax, i)
            profit = currentMax - i
            maxProfit = max(profit, maxProfit)
        return maxProfit