Time: 1 ms (100.00%), Space: 51.7 MB (81.75%) - LeetHub

rldnrl · rldnrl · commit e0300efba776 · 2023-01-02T22:25:22.000+09:00
diff --git a/0053-maximum-subarray/0053-maximum-subarray.java b/0053-maximum-subarray/0053-maximum-subarray.java
@@ -6,7 +6,7 @@ public int maxSubArray(int[] nums) {
         for (int i = 1; i < nums.length; i++) {
             int num = nums[i];
             curSum = Math.max(curSum + num, num);
-            answer = Math.max(curSum, answer);
+            answer = Math.max(answer, curSum);
         }
         
         return answer;

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@ public int maxSubArray(int[] nums) {`
`6`	`6`	`for (int i = 1; i < nums.length; i++) {`
`7`	`7`	`int num = nums[i];`
`8`	`8`	`curSum = Math.max(curSum + num, num);`
`9`		`- answer = Math.max(curSum, answer);`
	`9`	`+ answer = Math.max(answer, curSum);`
`10`	`10`	`}`
`11`	`11`
`12`	`12`	`return answer;`