LeetCode Problem : Maximum Subarray

Problem

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.

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.

Code

int maxSubArray(int A[], int n) {
    // IMPORTANT: Please reset any member data you declared, as
    // the same Solution instance will be reused for each test case.
    int sum = A[0];
    int max_sum = sum;
    for(int i = 1; i < n; ++i){
        if(sum > 0)
            sum = A[i] + sum;
        else
            sum = A[i];
        if(max_sum < sum)
            max_sum = sum;
    }
    return max_sum;
}