本文共 528 字,大约阅读时间需要 1 分钟。
题目:
解答:
依次累加,如果累加的和小于0,那么舍弃累加和。否则继续累加。
代码:
class Solution { public: int maxSubArray(int A[], int n) { int max = INT_MIN; int sum = 0; for (int i = 0; i < n; i++) { sum += A[i]; if (sum <= 0) { if (max < sum) max = sum; sum = 0; } else { if (max < sum) max = sum; } } return max; } };参考:
http://blog.csdn.net/pickless/article/details/9851509 代码写的很优雅
http://blog.csdn.net/joylnwang/article/details/6859677 理论讲解。
http://www.tuicool.com/articles/2ee6Bz