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 foo(int th_num, int n, int remain, std::vector<int> &curVector, std::vector<std::vector<int>> &returnVector)
{
if (remain == 0)
{
returnVector.push_back(curVector);
return;
}
for (int i = th_num; i <= n; i++)
{
curVector.push_back(i);
foo(i+1, n, remain-1, curVector, returnVector);
curVector.pop_back();
}
}
vector<vector<int> > combine(int n, int k) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
std::vector<int> curVector;
std::vector<vector<int>> returnVector;
if (k == 0)
return returnVector;
for (int i = 1; i <= n; i++)
{
curVector.push_back(i);
foo(i+1, n, k-1, curVector, returnVector);
curVector.pop_back();
}
}
};