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
.
Java:
public class Solution {
public int maxSubArray(int[] nums) {
if(nums.length == 0) return 0;
int sum = nums[0];
int maxInt = nums[0];
for(int i=1; i<nums.length;i++)
{
maxInt = Math.max(maxInt + nums[i],nums[i]);
sum = Math.max(sum,maxInt);
}
return Math.max(sum,maxInt);
}
}