Time: 1031 ms (37.50%), Space: 28 MB (40.39%) - LeetHub

shsewonitw · May 9, 2022 · 833d876 · 833d876
1 parent 175510c
commit 833d876
Showing 1 changed file with 7 additions and 0 deletions.
diff --git a/53-maximum-subarray/53-maximum-subarray.py b/53-maximum-subarray/53-maximum-subarray.py
@@ -0,0 +1,7 @@
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        # Kadane's algorithm
+        for i in range(1, len(nums)):
+            if nums[i - 1] > 0:
+                nums[i] += nums[i - 1]
+        return max(nums)