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为负数的连续subarray对可能的最大值没有帮助（除该连续subarray的sum为largest sum外）。所以很简单的，如果sum小于0，我们便置sum为0。代码如下：

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

Leetcode:Maximum Subarray

原文：http://www.cnblogs.com/Kai-Xing/p/4227343.html