77. Combinations
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],
]
题目大意:
其实就是要求C(n,k),n取k有多少种组合。
解题思路:
使用dfs解即可
class Solution {
public:
vector<vector<int> > res;
void generateCombined(int n,int k,int start,vector<int> c){
if(c.size()==k){
res.push_back(c);
return;
}
for(int i=start;i<n;i++){
c.push_back(i);
generateCombined(n,k,i+1,c);
c.pop_back();
}
}
vector<vector<int> > combine(int n, int k) {
if(n<=0||k<=0||k>n)
return res;
vector<int> c;
generateCombined(n,k,1,c);
}
};
结果:78ms