题解 | #连续子数组的最大和#
连续子数组的最大和
https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
#include <climits>
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int first = array[0];
int second = 0;
int result = array[0];
for(int i = 1; i < array.size(); i++){
second = max(first + array[i], array[i]);
result = max(result, second);
first = second;
}
return result;
}
};
#刷题找工作啊#
投递美团等公司10个岗位
。