题目描述
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 {
public:
vector<vector<int> > combine(int n, int k)
{
vector<vector<int>> res;
vector<int> combine;
dfs(n,k,1,res,combine);
return res;
}
void dfs(int n,int k,int start,vector<vector<int>> &res,vector<int> &combine)
{
if(combine.size() == k)
{
res.push_back(combine);
return;
}
for(int i=start;i<=n;i++)
{
combine.push_back(i);
dfs(n,k,i+1,res,combine);
combine.pop_back();
}
}
};