题目:
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:
vector<vector<int> > combine(int n, int k) {
ans.clear();
a.resize(k);
dfs(0, k, n, 1);
return ans;
}
private:
vector<vector<int>> ans;
vector<int> a;
void dfs(int depth, int maxDepth, int n, int start) {
if (depth == maxDepth) {
ans.push_back(a);
return;
}
for (int i = start; i <= n; i++) {
a[depth] = i;
dfs(depth + 1, maxDepth, n, i + 1);
}
}
};