【100题】最大子数组和

#include <iostream>
using namespace std;

bool FindGreatestSumOfArray(int *pData,unsigned int nLength,int &nGreatestSum)
{
	if(pData == NULL || nLength <= 0)
	{
		return false;
	}

	int nCurSum = nGreatestSum = 0;
	for(unsigned int i=0; i<nLength; ++i)
	{
		nCurSum += pData[i];
		if(nCurSum < 0)
		{
			nCurSum = 0;
		}
		if(nCurSum > nGreatestSum)
		{
			nGreatestSum = nCurSum;
		}
	}

	if(nGreatestSum == 0)
	{
		nGreatestSum = pData[0];
		for(unsigned int i=1; i < nLength; ++i)
		{
			if(pData[i] >  nGreatestSum)
			{
				nGreatestSum = pData[i];
			}
		}
	}

	return true;
}

void main()
{
	int a[] = {1,-2,-1,3,4,-5,-8};
	int sum = 0;
	FindGreatestSumOfArray(a,sizeof(a)/sizeof(a[0]),sum);
	cout << sum <<endl;
}