LeetCode77
解法:
class Solution {
public:
vector<vector<int>> result;
vector<int> ans;
void backtracing(int index,int k,int n){
if(ans.size() == k){
result.push_back(ans);
return;
}
for(int i = index;i <= n;i++){
ans.push_back(i);
backtracing(i + 1, k, n);
ans.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
int index = 1;
backtracing(index, k, n);
return result;
}
};