optimized code to reduce runtime, faster than 98%

iamyoshita · web-flow · commit 458069c94745 · 2022-08-29T17:02:15.000-04:00
There is no need to initialize res as max(nums[0]) because the loop takes care of that.
diff --git a/python/152-Maximum-Product-Subarray.py b/python/152-Maximum-Product-Subarray.py
@@ -1,7 +1,7 @@
 class Solution:
     def maxProduct(self, nums: List[int]) -> int:
         # O(n)/O(1) : Time/Memory
-        res = max(nums)
+        res = nums[0]
         curMin, curMax = 1, 1
 
         for n in nums:
