最大子数组之和

#include <iostream>
using namespace std;

int maxSub(int a[], int size) //size为数组a的长度
{
int maxSum = 0, Sum = 0;
for (int j = 0; j < size; j++)
{
Sum += a[j];
if (Sum > maxSum)
maxSum = Sum;
else if (Sum < 0)
Sum = 0;
}
return maxSum;
}

int main()
{
int arr1[10] = { 1, -2, 3,-4, 5, -6, 7, -5, 8, 9 };
cout << "The Max sum of the subarray is :" <<maxSub(arr1, 10) << end>>

#include <iostream>
using namespace std;


int maxSub(int a[], int size) //size为数组a的长度
{
	int maxSum = 0, Sum = 0;
	for (int j = 0; j < size; j++)
	{
		Sum += a[j];
		if (Sum > maxSum)
			maxSum = Sum;
		else if (Sum < 0)
			Sum = 0;
	}
	return maxSum;
}

int main()
{
	int arr1[10] = { 1, -2, 3,-4, 5, -6, 7, -5, 8, 9 };
	cout << "The Max sum of the subarray is :" <<maxSub(arr1, 10) << endl;

}