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:
void DFS(vector<vector<int> >&ans, int n, int k, vector<int> &tmp, int step, int cur)
{
if (step == k)
{
ans.push_back(tmp);
return;
}
for (int i = cur; i <= n; ++i)
{
tmp[step] = i;
DFS(ans, n, k, tmp, step + 1, i + 1);
}
}
vector<vector<int> > combine(int n, int k) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
vector<vector<int> > ans;
if (n == 0)
{
return ans;
}
if (k == 0)
{
vector<int> vec;
ans.push_back(vec);
return ans;
}
vector<int> tmp;
tmp.resize(k);
DFS(ans, n, k, tmp, 0, 1);
return ans;
}
};