Maximum Subarray

时间：2014-11-08 16:42:28 收藏：0 阅读：241

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.

Hide Tags

Divide and Conquer Array Dynamic Programming

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

原文：http://www.cnblogs.com/li303491/p/4083563.html