Time: 2 ms (66.09%), Space: 73.6 MB (60.38%) - LeetHub

Author: maniezhilan

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

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