解法一:DFS recursion
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> res;
vector<int> out;
helper(n, k, 0, out, res);
return res;
}
void helper(int n, int k, int pos, vector<int>& out, vector<vector<int>>& res){
if(k==0) res.push_back(out);
else{
for(int i=pos;i<n;i++){
out.push_back(i+1);
helper(n, k-1, i+1, out, res);
out.pop_back();
}
}
}
};
recursion function
1. int n -- original input
2. int k -- when to stop
3. int pos -- where you are at
4. vector<int>& out -- generating the solution
5. vector<vector<int>>& res -- collect the solutions
解法二:self-recursion
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
if (k > n || k < 0) return {};
if (k == 0) return {{}};
vector<vector<int>> res = combine(n-1, k-1);
for(auto& a:res) a.push_back(n);
for(auto& a:combine(n-1, k)) res.push_back(a);
return res;
}
};
理解:C(n, k) = C(n-1, k-1) + C(n-1, k)
解法三:iteration
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> res;
vector<int> out(k, 0);
int i = 0;
while (i >= 0) {
++out[i];
if (out[i] > n) --i;
else if (i == k - 1) res.push_back(out);
else {
++i;
out[i] = out[i - 1];
}
}
return res;
}
};