LeetCode Maximum Subarray

面试题，做过无数次了，不废话。

int maxSubArray(int A[], int n) {
	int curmax = A[0];
	int max = curmax;
	for (int i=1;i<n;i++)
	{
		if (curmax + A[i]>A[i])
			curmax = curmax + A[i];
		else
			curmax = A[i];
		if (curmax>max)
		{
			max = curmax;
		}
	}
	return max;
}