Time: 995 ms (5.04%) | Memory: 286.7 MB (6.47%) - LeetSync

Author: joshua-dierickse-alt

53-maximum-subarray/maximum-subarray.py

@@ -1,14 +1,21 @@
+from functools import lru_cache
 import math
 
 class Solution:
-    def maxSubArray(self, nums: List[int]) -> int:
-        m = -math.inf
 
-        c = 0
+    @lru_cache(maxsize=None)
+    def r(self, i, b):
+        if i >= len(self.nums):
+            return -math.inf
+
+        if b:
+            return max(self.nums[i], self.nums[i] + self.r(i + 1, True))
+        else:
+            return max(self.r(i, True), self.r(i + 1, False))
 
-        for num in nums:
-            c += num
-            m = max(m, c)
-            c = max(c, 0)
 
-        return m
+    def maxSubArray(self, nums: List[int]) -> int:
+        self.nums = nums
+
+        return self.r(0, False)
+