Files
PS/leetcode/121.py
Gyubin Han dede0dca01 leetcode
2025-02-19 14:09:55 +09:00

10 lines
244 B
Python

class Solution:
def maxProfit(self, prices: List[int]) -> int:
result=0
mi=prices[0]
for i in range(1,len(prices)):
mi=min(prices[i],mi)
result=max(prices[i]-mi,result)
return result