leetcode 25: 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.

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