class Solution {
public int maxSubArray(int[] nums) {
int maxSum = 0;
int currSum = 0;
for(int i = 1; i < nums.length; i++){
currSum = currSum+nums[i];
if(currSum > maxSum)
maxSum = currSum;
if(currSum <= 0)
currSum = 0;
}
return maxSum;
}}