组给出两个整数n和k,返回从1......n中选出的k个数的组合。
样例
例如 n = 4 且 k = 2
返回的解为:
[[2,4],[3,4],[2,3],[1,2],[1,3],[1,4]]
解题思路:元素放于不放入数组的思想
class Solution {
public:
void backtracing(vector<vector<int> > &ret,vector<int> &tmp,int cur,int n,int k){
if(tmp.size()==k){
ret.push_back(tmp);
return ;
}
if(cur>n)
return ;
tmp.push_back(cur);
backtracing(ret,tmp,cur+1,n,k);
tmp.pop_back();
backtracing(ret,tmp,cur+1,n,k);
}
vector<vector<int> > combine(int n, int k) {
vector<vector<int> > ret;
vector<int> tmp;
backtracing(ret,tmp,1,n,k);
return ret;
}
};