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

        for (int num : nums) {
            if (curSum < 0) {
                curSum = 0;
            }

            curSum += num;
            maxSum = Math.max(maxSum, curSum);
        }
        return maxSum;
    }
}