Add maxium-subarray solution - s0ooo0k

Author: s0ooo0k

maximum-subarray/Solution.java

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