算法刷题记录 Day21
Date: 2024.03.15
lc 77. 组合
class Solution {
private:
vector<vector<int>> res;
public:
void backTracking(vector<int>& a, int idx, int k, int n){
// cout<<"a:";
// for(auto& x: a){
// cout<<x;
// }
// cout<<endl;
// cout<<"idx:"<<idx<<endl;
if(a.size() == k){
res.push_back(a);
return;
}
for(int i=idx; i<=n; i++){
a.push_back(i);
backTracking(a, i+1, k, n);
a.pop_back();
}
return;
}
vector<vector<int>> combine(int n, int k) {
vector<int> a;
backTracking(a, 1, k, n);
return res;
}
};