问题描述
一个整数数组中的元素有正有负,在该数组中找出一 个连续子数组,要求该连续子数组中各元素的和最大,这个连续子数组便被称作最大连续子数组。比如数组{2,4,-7,5,2,-1,2,-4,3}的最大连续子数组为{5,2,-1,2},最大连续子数组的和为5+2-1+2=8。问题输入就是一个数组,输出该数组的“连续子数组的最大和”。
解法1 暴力法 O(N^2)
public static int maxSum(int[] array){
if(null == array || array.length == 0){
return 0;
}
int max = array[0];
for(int i = 0; i < array.length; i++){
int tmp = 0;
for(int j = i; j < array.length; j++){
tmp += array[j];
if(tmp > max){
max = tmp;
}
}
}
return max;
}
解法2 分治法 O(NlgN)
public static int maxArraySum(int[] array, int left, int right){
if(left == right){
return array[left];
}else{
int mid = left + (right - left) / 2;
int leftMaxSum = maxArraySum(array, left, mid);
int rightMaxSum = maxArraySum(array, mid + 1, right);
int crossMaxSum = crossMaxSum(array, left, mid, right);
return Math.max(Math.max(leftMaxSum, rightMaxSum), crossMaxSum);
}
}
public static int crossMaxSum(int[] array, int left, int mid, int right){
int leftMaxSum = 0;
int tmp = 0;
for(int i = mid; i >= left; i--){
tmp += array[i];
leftMaxSum = Math.max(leftMaxSum, tmp);
}
tmp = 0;
int rightMaxSum = 0;
for(int i = mid + 1; i <= right; i++){
tmp += array[i];
rightMaxSum = Math.max(rightMaxSum, tmp);
}
return leftMaxSum + rightMaxSum;
}
解法3 O(N)
public static int maxSum(int[] array){
if(null == array || array.length == 0){
return 0;
}
int tmp = array[0];
int max = array[0];
for(int i = 1; i < array.length; i++){
if(tmp < 0){
tmp = 0;
}
tmp += array[i];
max = Math.max(max, tmp);
}
return max;
}