题解 | #连续子数组的最大和#

class Solution { public: int FindGreatestSumOfSubArray(vector array) { int res = 0; vector vec; bool flag = 1; for(int i = 0; i < array.size(); i ++ ) { if(array[i] > 0) { flag = 0; } res = max(res + array[i], 0); vec.push_back(res); } if(flag)//全是负数 { int my_ans = -2e9; for(int i = 0; i < array.size(); i ++ ) { if(array[i] > my_ans) { my_ans = array[i]; } } return my_ans; } sort(vec.begin(), vec.end());

    res = vec[vec.size() - 1];
    return res;
}

};