Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
Example:
Input: n = 4, k = 2 Output: [ [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>> ret;
vector<int> out;
helper(n,k,1,out,ret);
return ret;
}
void helper(int n,int k,int level,vector<int> &out,vector<vector<int>> &ret)
{
if(out.size()==k)
ret.push_back(out);
for(int i=level;i<=n;i++)
{
out.push_back(i);
helper(n,k,i+1,out,ret);
out.pop_back();
}
}
};
public:
vector<vector<int>> combine(int n, int k)
{
vector<vector<int>> ret;
vector<int> out;
helper(n,k,1,out,ret);
return ret;
}
void helper(int n,int k,int level,vector<int> &out,vector<vector<int>> &ret)
{
if(out.size()==k)
ret.push_back(out);
for(int i=level;i<=n;i++)
{
out.push_back(i);
helper(n,k,i+1,out,ret);
out.pop_back();
}
}
};