力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台
class Solution {
public:
vector<vector<int>>result;
vector<int>path;
void backtracking(int n, int k, int stratindex) {
if (path.size()==k) {//判断结束条件
result.push_back(path);
return;
}
for (int i=stratindex;i<=n;i++) {
path.push_back(i);//处理节点
backtracking(n,k,i+1); // 递归
path.pop_back();//回溯
}
}
vector<vector<int>> combine(int n, int k) {
backtracking(n,k,1);
return result;
}
};