Merge pull request #1946 from CodingTestStudy2/최민지

[최민지] Day33

Author: github-actions[bot]

leetcode3/최민지/121.py

@@ -0,0 +1,11 @@
+class Solution:
+    def maxProfit(self, prices: List[int]) -> int:
+        min_price = prices[0]
+        max_profit = 0
+        for price in prices:
+            if price < min_price:
+                min_price = price
+            elif price - min_price > max_profit:
+                max_profit = price - min_price
+        return max_profit
+