版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/ShellDawn/article/details/88967204
前缀和:
class Solution {
public:
vector<vector<int> > FindContinuousSequence(int sum) {
vector<int> s;
s.push_back(0);
for(int i=1;i<sum/2+2;i++){
s.push_back(s[i-1] + i);
}
vector<vector<int> > ans;
for(int i=0;i<sum/2+2;i++){
for(int j=i+2;j<sum/2+2;j++){
if(s[j] - s[i] == sum){
vector<int> t;
for(int k=i+1;k<=j;k++) t.push_back(k);
ans.push_back(t);
break;
}
if(s[j] - s[i] > sum ) break;
}
}
return ans;
}
};