maximum subarray 로직 수정 : 공간 최적화

Author: devyejin

maximum-subarray/devyejin.py

@@ -1,10 +1,11 @@
 class Solution:
     def maxSubArray(self, nums: list[int]) -> int:
-        dp = [0] * len(nums)
-        dp[0] = nums[0]
+        current_sum = nums[0]
+        max_sum = nums[0]
 
         for i in range(1, len(nums)):
-            dp[i] = max(nums[i], dp[i - 1] + nums[i])
+            current_sum = max(nums[i], current_sum + nums[i])
+            max_sum = max(current_sum, max_sum)
 
-        return max(dp)
+        return max_sum