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.

More practice:

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

经典题目，只不过题中的输入数据有可能是负数，要考虑一下。

另外，题里要求用divide and conquer的方法再coding一个solution出来，现在没时间写了，大概想了一下，应该是要记录最长子序列的起始位置和长度，然后在merge的时候做判断，不知道这有什么subtle的。有人能给个看法么？

class Solution {
public:
    int maxSubArray(int A[], int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int count = 0;
        int sum = A[0];
        for(int i = 0; i< n; ++i){
            count += A[i];
            if(count < 0){
                sum = sum > count ? sum : count;
                count = 0;
            }
            else{
                sum = sum > count ? sum : count;
            }
        }
        return sum;
    }
};