class Solution {
public:
vector <vector<int> >ans;
vector<int>path;
void backtracking(int n,int k,int startIndex){
if(path.size()==k){
ans.push_back(path);
return;
}
for(int i=startIndex;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 ans;
}
};
77. 组合
最新推荐文章于 2024-08-09 20:36:57 发布