Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [-2,1,-3,4,-1,2,1,-5,4],
the contiguous subarray [4,-1,2,1] has the largest sum = 6.
public class Solution {
public int maxSubArray(int[] nums) {
int sum = nums[0];
int maxnums = nums[0];
for(int i=1;i<nums.length;i++)
{
if(sum<0)
sum = 0;
sum += nums[i];
// System.out.println(sum);
maxnums = Math.max(maxnums,sum);
}
return maxnums;
}
}
