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 maxSum = 0;
int cur = 0;
for(int i = 0; i < arr.size(); i++)
{
cur = cur + arr[i];
if (cur < 0)
cur = 0; // 从零开始的异世界生活
if (cur > maxSum)
maxSum = cur;
}
return maxSum;
}
};
京公网安备 11010502036488号