题目链接:https://leetcode.cn/problems/he-wei-sde-lian-xu-zheng-shu-xu-lie-lcof/
题目如下:
class Solution {
public:
vector<vector<int>> findContinuousSequence(int target) {
vector<vector<int>> res;
vector<int> path;
int sum=0;
for(int i=1;i<target;i++){//起始位置
sum=i;
path.push_back(i);
for(int j=i+1;j<target;j++){//终止位置
sum+=j;
path.push_back(j);
if(sum>target){
path.clear();
sum=0;
break;
}
if(sum==target){
res.push_back(path);
break;
}
}
}
return res;
}
};