LeetCode:Maximum Subarray

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.

思路：初始化sum和max值为数组首元素值，从头开始遍历数组，sum<0则将sum置为0，sum>max则更新max为sum。

class Solution {
    public:
        int maxSubArray(int A[],int n) {
            int sum=A[0],max=sum;
            for(int i=1;i<n;i++)
            {
                if(sum<0)
                    sum=0;
                sum+=A[i];
                if(sum>max)
                    max=sum;
            }
            return max;
        }
};