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=0;
int cur=0;
for(int i=0;i<arr.size();i++){
cur=cur+arr[i];
if(cur<0)
cur=0;
if(cur>max)
max=cur;
}
return max;
}
};
如果相加得到小于0的数,那就清0.