题解 | #连续子数组的最大和#抛砖引玉
连续子数组的最大和
https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int len = array.size();
int sum = 0;
int res = -101;
for(int i = 0;i < len;i++){
sum += array[i];
res = max(res,sum);
if(sum < 0)
sum = 0;
}
return res;
}
};
查看5道真题和解析
华为HUAWEI工作强度 1372人发布