题解 | #连续子数组的最大和#
连续子数组的最大和
https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
#include <algorithm>
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int max = INT32_MIN;
int cur = max;
for (const auto& val : array)
{
cur = std::max(val, cur + val);
max = std::max(max, cur);
}
return max;
}
};
