题解 | #最长无重复子数组#
最长无重复子数组
https://www.nowcoder.com/practice/b56799ebfd684fb394bd315e89324fb4
class Solution {
public:
int FindGreatestSumOfSubArray(vector<int> array) {
int sum = 0, maxSum = INT_MIN;
for(int num : array){
sum += num;
maxSum = max(maxSum, sum);
if(sum < 0) sum = 0;
}
return maxSum;
}
};
