连续子数组的最大和

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array[−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray[4,−1,2,1]has the largest sum =6.
click to show more practice.

class Solution {
    public:
    int maxSubArray(int A[], int n) {
        if(n==0) return 0;
        int max=INT_MIN;
        int sum=0;
        for(int i=0;i<n;i++)
        {
            sum+=A[i];
            if(max < sum) max = sum;//这一句必须在前
            if(sum<0)
                sum=0;
        }
        return max;
    }
};