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[] A) {
int sum = -224343, b=-224343;
int len = A.length;
for(int i=0; i<len; i++){
if(b < 0) b = A[i];
else b += A[i];
if(b > sum) sum = b;
}
return sum;
}
}