leetcode/array/max_profit.py

from typing import List
import heapq

def maxProfit(prices: List[int]) -> int:
    inf = int(1e9)
    min_price = inf
    max_profit = 0
    for price in prices:
        max_profit = max(price - min_price, max_profit)
        min_price = min(price, min_price)
    return max_profit