Sync LeetCode submission Runtime - 27 ms (90.14%), Memory - 26.9 MB (7.24%)

Author: jimit105

0121-best-time-to-buy-and-sell-stock/solution.py

@@ -1,18 +1,18 @@
 # Approach 2: One Pass
 
-# Time: O(N)
+# Time: O(n)
 # Space: O(1)
 
 class Solution:
     def maxProfit(self, prices: List[int]) -> int:
         min_price = float('inf')
         max_profit = 0
-        
+
         for price in prices:
             if price < min_price:
                 min_price = price
-            elif price - min_price > max_profit:
+            if price - min_price > max_profit:
                 max_profit = price - min_price
-                
+
         return max_profit