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> path;
scan(1, k, n, path, res);
return res;
}
void scan(int level,int k,int &n,vector<int> &path,vector<vector<int>> &res){
if (k == 0){
res.push_back(path);
}
for (int i = level; i <= n; i++){
path.push_back(i);
scan(i + 1, k - 1, n, path, res);
path.pop_back();
}
}
};