原题链接:77. 组合
solution:
class Solution {
public:
vector<vector<int>> res;
vector<int> path;
void dfs(int n,int k,int start)
{
if(path.size() == k){
res.push_back(path);
return;
}
for(int i=start;i<=n;i++){ //i如果从1开始会有重复的比如[1,4][4,1];
path.push_back(i);
dfs(n, k, i+1);
path.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
dfs(n,k,1);
return res;
}
};