剑指offer 面试题31 求连续子数组的最大和

#include <iostream>
using namespace std;
//solution1
bool InvalidInput=false;
int MaxSumOfSubArray(int *number,int length){
	InvalidInput=false;
	if(number==NULL||length<=0){
		InvalidInput=true;
		return 0;
	}
	int CurrentSum=0,MaxSum=0;
	for(int i=0;i<length;++i){
		CurrentSum+=number[i];
		if(CurrentSum>MaxSum)
			MaxSum=CurrentSum;
		if(MaxSum<number[i])
			MaxSum=CurrentSum=number[i];
	}
	return MaxSum;
}
//solution2 to be continued
int main(){
	int array[]={1,-2,3,10,-4,7,2,-5};
	cout<<MaxSumOfSubArray(array,sizeof(array)/sizeof(*array));
}