-----QUESTION-----
Given two integers
For example,
If
[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4], ]
-----SOLUTION-----
class Solution {
public:
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> result;
vector<int> pre;
dfs(result,pre,n,k,1);
return result;
}
void dfs( vector<vector<int>> &result, vector<int> pre, int n, int k, int depth)
{
if(depth > n) return;
pre.push_back(depth);
if(pre.size() < k)
{
dfs(result,pre,n,k,depth+1);
}
else
{
result.push_back(pre);
}
pre.pop_back();
dfs(result,pre,n,k,depth+1);
}
};