1、有一个整形数组,其元素包含正整数和负整数,找到它的所有子集中元素之和最大的那个子集。
如:[12,-3,54,-42,4,5,7],结果为63[12,-3,54]。
要求复杂度为O(n)。
int
func(
int
n,
int
a[])
{
int sum = 0 , b = 0 , i;
for (i = 1 ; i <= n; i ++ )
{
if (b > 0 ) b += a[i];
else b = a[i];
if (b > sum) sum = b;
}
return sum;
}
{
int sum = 0 , b = 0 , i;
for (i = 1 ; i <= n; i ++ )
{
if (b > 0 ) b += a[i];
else b = a[i];
if (b > sum) sum = b;
}
return sum;
}
2、求乱序排序的N个数中连续K个数的和的最大值。
具体思路:
假设有N个数:a1 a2 a3 a4 a5 ... aN
需要求出所有连续K个数的和,那么,先求出a1~ak的和sum
a(2)~a(k+1)的和=sum - a1 + a(k+1)---------------------(1)
a(3)~a(k+2)的和=(1)式结果-a(2) + a(k+2)
Code
#include <iostream>
using namespace std;
int main()
{
int n, k;
int *num;
int sum;
int max;
cout << "请输入数字的个数n: ";
cin >> n;
cout << "请输入k: ";
cin >> k;
if (!( n > 0 && k <= n))
{
return 0;
}
num = new int[n];
cout << "请输入n个整数: ";
sum = 0;
for (int i = 0; i < n; i++)
{
cin >> num[i];
if (i < k) sum += num[i]; //在读入数字的过程中,先计算最前面k个数字的和
}
max = sum;
for (int i = k; i < n; i++)
{
sum = sum - num[i - k] + num[i]; //往后的每k个数字的和,都等于刚才计算出的sum减去最开头的数字num[i - k]再加上新的数字num[i]
if (sum > max)
{
max = sum;
}
}
cout << max << endl;
delete []num;
system("pause");
return 0;
}
#include <iostream>
using namespace std;
int main()
{
int n, k;
int *num;
int sum;
int max;
cout << "请输入数字的个数n: ";
cin >> n;
cout << "请输入k: ";
cin >> k;
if (!( n > 0 && k <= n))
{
return 0;
}
num = new int[n];
cout << "请输入n个整数: ";
sum = 0;
for (int i = 0; i < n; i++)
{
cin >> num[i];
if (i < k) sum += num[i]; //在读入数字的过程中,先计算最前面k个数字的和
}
max = sum;
for (int i = k; i < n; i++)
{
sum = sum - num[i - k] + num[i]; //往后的每k个数字的和,都等于刚才计算出的sum减去最开头的数字num[i - k]再加上新的数字num[i]
if (sum > max)
{
max = sum;
}
}
cout << max << endl;
delete []num;
system("pause");
return 0;
}