Time: 1 ms (100.00%), Space: 73 MB (76.92%) - LeetHub

Author: yeonjiyeon

53-maximum-subarray/53-maximum-subarray.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int maxSubArray(int[] nums) {
+       
+        int max = nums[0];
+        int sum = nums[0];
+        
+        for(int i = 1; i < nums.length; i++){
+            sum = Math.max(sum + nums[i], nums[i]);
+            
+            max = Math.max(max, sum);
+           
+        }
+        
+        return max;
+    }
+}