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 max = nums[0];
int localSum = 0;
for(int i = 0; i < nums.length; i++){
localSum += nums[i];
if(localSum > max)
max = localSum;
if(localSum < 0)
localSum = 0;
}
return max;
}
}