题解 | #子数组的最大累加和问题#

class Solution {
public:
/**
* max sum of the subarray
* @param arr int整型vector the array
* @return int整型
*/
int maxsumofSubarray(vector<int>& arr) {
// write code here
int max_num = arr[0];
int prev_sum = 0;
int size = arr.size();
for (int i = 0; i < size; ++i){
if(arr[i]>(prev_sum+arr[i])){
prev_sum = arr[i];
}else{
prev_sum += arr[i];
}
if(prev_sum>max_num){
max_num = prev_sum;
}
}
return max_num;
}
};</int>