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) {
vector<vector<int>> res;
vector<int> temp;
helper(res, 1, n, temp, k);
return res;
}
void helper(vector<vector<int>>& res, int begin, int n,vector<int>& temp, int& k){
if(k == 0){
res.push_back(temp);
return;
}
if(begin > n) return ;
for(int i = begin; i <= n; i++){
temp.push_back(i);
k--;
helper(res, i + 1, n, temp, k);//这里一定不是helper(res, begin + 1, n, temp, k); 切记!
k++;
temp.pop_back();
}
}
//注意: 还有一种写法:
/*void helper(vector<vector<int>>& res, int begin, int n,vector<int>& temp, int k){
if(k == 0){
res.push_back(temp);
return;
}
if(begin > n) return ;
for(int i = begin; i <= n; i++){
temp.push_back(i);
//k--;
helper(res, i + 1, n, temp, k - 1);//这里 k - 1 用的是DFS的方法 ,注意此时 k 是传值。
//k++;
temp.pop_back();
}
}*/
};