maximum-subarray solution

Author: sejineer

maximum-subarray/sejineer.py

@@ -0,0 +1,13 @@
+"""
+시간 복잡도 O(N)
+공간 복잡도 O(N)
+"""
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        dp = [0] * len(nums)
+        dp[0] = nums[0]
+
+        for i in range(1, len(nums)):
+            dp[i] = max(nums[i], dp[i - 1] + nums[i])
+        
+        return max(dp)