Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
public int maxSubArray(int[] nums) {
int ans = nums[0];
int sum = 0;
for(int i = 0; i < nums.length; i++){
sum += nums[i];
ans = Math.max(ans,sum);
sum = Math.max(0,sum);
}
return ans;
}