hunter学算法-从一个数组中找到和最大的子数组，数组中可能有负数。

//============================================================================
// Name        : MaxSubArray.cpp
// Author      : jue
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
using namespace std;

class MyData
{
public:
	int startIndex;
	int endIndex;
	int maxData;
};

int getSum(int datas[],int start,int end)
{
	int sum = 0;
	for(int i = start;i <= end;i++)
	{
		sum += datas[i];
	}
	return sum;
}

MyData* findMaxSubArray(int datas[],int length)
{
	MyData *data = new MyData;
	for( int i = 0; i < length;i ++){
		for( int j = i; j < length; j ++)
		{
			int sum = getSum(datas,i,j);
			if((i == 0 && j==0) || (sum > data->maxData))
			{
				data->maxData = sum;
				data->startIndex = i;
				data->endIndex = j;
			}

		}
	}
	return data;
}

int main()
{
	int datas[] = {1,-2,-3};
	MyData* data = findMaxSubArray(datas,3);
	cout<<"max = "<<data->maxData<<"   start : "<<data->startIndex<<"   end : "<<data->endIndex;
	return 0;
}