首页 > 代码库 > Combinations(带for循环的DFS)
Combinations(带for循环的DFS)
Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
For example,
If n = 4 and k = 2, a solution is:
[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]
class Solution {private: vector<vector<int>> res; int myn; int num;public: void tra(int loc,int start,vector<int> temp){ if(loc==num+1) { res.push_back(temp); return; } for (int i=start;i<=myn;++i) { temp.push_back(i); tra(loc+1,i+1,temp); temp.erase(temp.end()-1); } } vector<vector<int>> combine(int n, int k) { myn=n; num=k; vector<int> temp; tra(1,1,temp); return res; }};
Combinations(带for循环的DFS)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。