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.

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.

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