1. 题目来源
链接:77. 组合
2. 题目解析
代码:
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
dfs(temp,n,k,0);
return res;
}
private:
vector<vector<int>> res;
vector<int> temp;
void dfs(vector<int>& temp,int n,int k,int x){
if(temp.size()==k){
res.push_back(temp);
return;
}
for(int i=x+1;i<=n;i++){
temp.push_back(i);
dfs(temp,n,k,i);
temp.pop_back();
}
}
};