Maximum Subarray <LeetCode>

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.

算法：用动态规划进行求解，时间复杂度是O(n

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

)