Time: 538 ms (47.15%), Space: 30.9 MB (72.36%) - LeetHub

Author: birdieHyun

0053-maximum-subarray/0053-maximum-subarray.py

@@ -0,0 +1,8 @@
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        dp = []
+        dp.append(nums[0])
+        for i in range(1, len(nums)):
+            dp.append(max(dp[i - 1] + nums[i], nums[i]))
+        
+        return max(dp)