Discription:
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], ]
Solution:
void combine(int n, int k, int begin, vector<vector<int>> &result, vector<int> &temp)
{
if (k == 0){
result.push_back(temp);
return;
}
for (int i = begin; i <= n; ++i){
temp.push_back(i);
combine(n, k - 1, i + 1, result, temp);
temp.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> result;
vector<int> temp;
combine(n, k, 1, result, temp);
return result;
}
GitHub-Leetcode:
https://github.com/wenwu313/LeetCode