题目:一个有N个整数元素的一维数组(A[0], A[1], A[2], ...A[n-2], A[n-1]),写程序求子数组之和的最大值。如(-2,5,3,-6,4,-8,6)符合条件的子数组为5,3,返回值为8。
该题有三种解法,时间复杂度分为O(n^2), O(nlogn), O(n)。具体解法如下:
(1)时间复杂度为O(n^2):
int max_sum(int *A, int n)
{
int max=-1;
int i, j, sum;
for(i =0; i < n; i++)
{
sum = 0;
for(j = i; j < n; j++)
{
sum+=A[j];
if(sum > max)
{
max = sum;
}
}
}
return max;
}
(2)时间复杂度为O(nlogn):
int max_sum(int *a, int low, int high)
{
if(low >= high)
return 0;
int max = 0, kl = 0, kr = 0;
int mid = (low+high)/2;
int maxleft = max_sum(a, low, mid);
int maxright = max_sum(a, mid+1, high);
for(int i = mid; i >= low; i--)
{
kl +=a[i];
if(kl > max)
{
max = kl;
}
}
kl = max;
max = 0;
for(int j = mid+1; j <= high; j++)
{
kr += a[j];
if(kr > max)
{
max = kr;
}
}
kr = max;
max = 0;
int klr = kl + kr;
max = maxleft > maxright ? maxleft : maxright;
max = max > klr ? max : klr;
return max;
}
(3)时间复杂度为O(n):
int max_sum(int *a, int n)
{
int max = 0, mid = 0;
for(int i = 0; i < n; i++)
{
mid = a[i];
max += mid;
max = max > mid ? max : mid;
}
return max;
}
总结:从这道题可以看出,一道题是有很多解法的,只要去想。