题目描述:
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],
]
Hide Tags Backtracking
分析:
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],
]
Hide Tags Backtracking
分析:
本人不是很擅长递归,借鉴了大神的思路,然后理解成自己的.
/**12ms*/
class Solution {
public:
void combHelp(int n,int k,int start,int cnt, vector<int> &temp,vector<vector<int> > &res){
if(cnt == k) //cnt为当前集合元素的数目,当其为k时,直接写入结果集
res.push_back(temp);
for(int i = start; i <= n; i++){ 从start开始,构造数目为k的子集。
temp.push_back(i);将当前元素加入子集
combHelp(n,k,i+1,cnt+1,temp,res); //递归从下一个元素开始,找出k-cnt个元素添加进来
temp.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
vector<vector<int>> res;
vector<int> temp;
combHelp(n,k,1,0,temp,res);
return res;
}
};