LeetCode Maximum Subarray

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) {
		if(NULL == A || 0 == n)
			return 0;
		int ret = A[0];
		int curMax = 0;
		for(int i = 0; i < n; ++i)
		{
			if(curMax >= 0)
				curMax += A[i];
			else
				curMax = A[i];
			ret = max(ret, curMax);
		}
		return max(ret, curMax);
    }
};