-
77. 组合
-
class Solution { public: vector<vector<int>> b; vector<int> a; bool mark[1000]; void dfs(int n, int k,int s) { if (a.size() == k) { b.push_back(a); return; } for (int i = s; i <= n-k+a.size()+1; i++) { if (mark[i] == 0) { mark[i] = 1; a.push_back(i); dfs(n, k,i+1); mark[i] = 0; a.pop_back(); } } } vector<vector<int>> combine(int n, int k) { dfs(n, k,1); return b; } };
代码随想录算法训练营第二十四天|● 77. 组合
![](https://img-home.csdnimg.cn/images/20240711042549.png)