2023.02.25 Today's Challenge

https://leetcode.com/problems/best-time-to-buy-and-sell-stock/

Best Time to Buy and Sell Stock - LeetCode

n이 10^5라 O(n^2)은 TL 난다 =_=
알고 있었지만 시도 해봄. 역시나 TL

min_price와 max_profit 변수를 따로 둬서 풀면 되네..

class Solution:
    def maxProfit(self, prices: List[int]) -> int:
        min_price, max_profit = float('inf'), 0
        for price in prices:
            if price < min_price:
                min_price = price
            else:
                max_profit = max(max_profit, price - min_price)
        return max_profit