leetcode Maximum Subarray

利用动态规划方法

代码

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