回溯算法
理论基础
组合
法1:
vector<vector<int>> ans;
vector<int> path;
void backTracking(int n,int k, int startIndex){
if (path.size() == k){
ans.push_back(path);
return;
}
for (int i = startIndex; i <= n - (k - path.size()) + 1 /*i <= n*/; ++i) {//剪枝优化
path.push_back(i);
backTracking(n, k, i + 1);//递归
path.pop_back();//回溯
}
}
vector<vector<int>> combine(int n, int k) {
path.clear();
ans.clear();
backTracking(n,k,1);
return ans;
}