题解 | #连续子数组的最大和#
连续子数组的最大和
https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
vector<int> dp(array.size() + 1, 0);
for (int i = 1; i <= array.size(); i++) {
dp[i] = max(dp[i - 1] + array[i - 1], array[i - 1]);
}
return *max_element(++dp.begin(), dp.end());
}
};
