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.

动态规划解决方法：

动态规划基本思想（当前N的值由N-1的值推出）

class Solution {
public:
    int maxSubArray(int A[], int n) {
            int res=A[];
            int sum=A[];
            for(int i=;i<n;i++)
            {
                sum=max(sum+A[i],A[i]);
                res=max(res,sum);

            }
        return res;
    }
};