题解 | #子数组的最大累加和问题#
子数组的最大累加和问题
http://www.nowcoder.com/practice/554aa508dd5d4fefbf0f86e5fe953abd
class Solution {
public:
int maxsumofSubarray(vector<int>& arr) {
int maxsum = arr[0];
for (int i = 1; i < arr.size(); ++i) {
arr[i] = max(arr[i], arr[i] + arr[i - 1]);
maxsum = max(maxsum, arr[i]);
}
return maxsum;
}
};</int>
投递腾讯等公司6个岗位