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], ]
leetcode中Combination总共有四道题,总体思想上都是想通的,均是利用DFS,DFS方法的结构为:
void DFS(){
if(满足条件) 结束并push_back
else{
for()循环遍历{
push_back;
DFS(下一层);
pop_back();
}
}
}
class Solution {
public:
void com(int n, int k, int count, vector<vector<int> > &ans, vector<int> &temp){
if(temp.size()== k){
ans.push_back(temp);
return;
}
for(int i= count; i<= n; i++){
temp.push_back(i);
com(n, k, i+ 1, ans, temp);
temp.pop_back();
}
}
vector<vector<int> > combine(int n, int k) {
vector<vector<int> > ans;
vector<int> temp;
com(n, k, 1, ans, temp);
return ans;
}
};