算法训练营day24_回溯算法(2.28补)
77.组合
简单组合;
class Solution {
public:
vector<int> V;
vector<vector<int>> ans;
void dfs(int u,int n,int cnt){
if(cnt==0){
ans.push_back(V);
return;
}
if(u>n) return;
for(int i=u;i<=n&&n-i+1>=cnt;i++){
V.push_back(i);
dfs(i+1,n,cnt-1);
V.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
V.clear();
ans.clear();
dfs(1,n,k);
return ans;
}
};