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.
More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
public class Solution {
public int maxSubArray(int[] A) {
int n = A.length;
if(n == 0)
return 0;
if(n == 1)
return A[0];
int sum_cur = A[0];
int max_sum = A[0];
for(int i = 1; i<n ;i++){
if(sum_cur<0)
sum_cur = A[i];
else
sum_cur += A[i];
if(sum_cur > max_sum)
max_sum = sum_cur;
}
return max_sum;
}
}