这个非常经典,也很重要,还需好好理解。
class Solution {
public:
int maxSubArray(int A[], int n) {
int sum = 0;
int max = INT_MIN;
for (int i = 0; i < n; ++i) {
sum += A[i];
if (sum > max)
max = sum;
if (sum < 0)
sum = 0;
}
return max;
}
};
http://oj.leetcode.com/problems/maximum-subarray/