HZ偶尔会拿些专业问题来忽悠那些非计算机专业的同学。今天测试组开完会后,他又发话了:在古老的一维模式识别中,常常需要计算连续子向量的最大和,当向量全为正数的时候,问题很好解决。但是,如果向量中包含负数,是否应该包含某个负数,并期望旁边的正数会弥补它呢？例如:{6,-3,-2,7,-15,1,2,2},连续子向量的最大和为8(从第0个开始,到第3个为止)。你会不会被他忽悠住？

// test02.cpp : 定义控制台应用程序的入口点。
//

include "stdafx.h"

include

include

include

using namespace std;

class Solution {
public:
int FindGreatestSumOfSubArray(vector array) {
int max;
int sum = 0;

if(!array.empty())
max = array[0];

for (int i = 0;i < array.size();i++)
{
sum = array[i];
for (int j = i + 1;j < array.size();j++)
{
if (sum > max)
{
max = sum;
// cout << "max:" << max << endl;
}
sum += array[j];

}
if (sum > max)
{
max = sum;
// cout << "max:" << max << endl;
}

}
return max;
}
};

int main()
{
// vector vec = { 1,2,3,2,2,2,5,4,2 };
// vector vec = { 1, 2, 3, 2, 2, 2, 5, 4, 2 };
// vector vec = {6, -3, -2, 7, -15, 1, 2, 2};
//vector vec = {-2, -8, -1, -5, -9};
vector vec = { 2, 8, 1, 5, 9 };
int num = 0;
Solution so;
num = so.FindGreatestSumOfSubArray(vec);
//for (auto it = vec.begin();it != vec.end();it++)
//{
// cout<<*it<< " ";
//}
//
cout << "num:" << num << endl;

cout << endl;

return 0;
}