首页 > 代码库 > Combinations
Combinations
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],]
C++实现代码:
#include<iostream>#include<vector>using namespace std;class Solution {public: vector<vector<int> > combine(int n, int k) { if(n==0||k==0||n<k) return vector<vector<int> >(); vector<vector<int> > ret; vector<int> path; combinehelper(n,k,1,ret,path); return ret; } void combinehelper(int n,int k,int start,vector<vector<int> > &ret,vector<int> &path) { if(k==0) { ret.push_back(path); return; } int i; for(i=start;i<=n;i++) { path.push_back(i); combinehelper(n,k-1,i+1,ret,path); path.pop_back(); } }};int main(){ Solution s; vector<vector<int> > result=s.combine(1,2); for(auto a:result) { for(auto v:a) cout<<v<<" "; cout<<endl; }}
Combinations
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。