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 = INT_MIN; int cur = 0; for(int i=0;i<arr.size();i++) { cur += arr[i]; max = max > cur ? max:cur; cur = cur < 0 ? 0 : cur; } return max; } };