#53.Maximum Subarray [LeetCode Grind 75 in Java]

class Solution {
    public int maxSubArray(int[] nums) {
        //sliding window
        int maxSum = nums[0];
        int curSum = nums[0];

        int n = nums.length;

        for(int i = 1 ; i < n ; i ++){
            curSum = Math.max(nums[i], curSum + nums[i]);
            maxSum = Math.max(curSum, maxSum);
        }

        return maxSum;
    }
}