s0077 optimization
This commit is contained in:
@@ -9,7 +9,8 @@ void combineDFS(int n, int k, int begin, vector<int> &path,
|
||||
}
|
||||
|
||||
// 遍历可能的搜索起点
|
||||
for (int i = begin; i <= n; ++i) {
|
||||
// 在这一步中,每一次循环都可以对末尾进行限制来剪枝
|
||||
for (int i = begin; i <= n - (k - path.size()) + 1; ++i) {
|
||||
// 将 i 加入路径
|
||||
path.push_back(i);
|
||||
// 下一轮搜索
|
||||
|
Reference in New Issue
Block a user