回溯算法理论基础
void backtracking(参数) {
if (终止条件) {
存放结果;
return;
}
for (选择:本层集合中元素(树中节点孩子的数量就是集合的大小)) {
处理节点;
backtracking(路径,选择列表); // 递归
回溯,撤销处理结果
}
}
第77题. 组合
C++:
class Solution {
public:
vector<vector<int>> res;
vector<int> temp;
void backTracting(int n,int k,int firstIndex){
if(temp.size()==k){
res.push_back(temp);
return;
}
for(int i=firstIndex;i<=n;i++){
temp.push_back(i);
backTracting(n,k,i+1);
temp.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
if(k==0) return res;
backTracting(n,k,1);
return res;
}
};
C++:剪枝优化:
class Solution {
public:
vector<vector<int>> res;
vector<int> temp;
void backTracting(int n,int k,int firstIndex){
if(temp.size()==k){
res.push_back(temp);
return;
}
for(int i=firstIndex;i<=n-(k-temp.size())+1;i++){
temp.push_back(i);
backTracting(n,k,i+1);
temp.pop_back();
}
}
vector<vector<int>> combine(int n, int k) {
if(k==0) return res;
backTracting(n,k,1);
return res;
}
};