algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-12 05:20:59 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0039.组合总和.md, 修复Python代码的一个bug

Browse Source 
Python 版本的回溯剪枝版本一当中,  break 会终止整个for 循环，从而提前终止搜索，应该改成continue
This commit is contained in:
TonySu
2023-07-16 22:00:05 +08:00
committed by GitHub
parent 7be046037a
commit 5794b17ab4
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0039.组合总和.md
View File

@ -311,7 +311,7 @@ class Solution:
for i in range(startIndex, len(candidates)): for i in range(startIndex, len(candidates)):
if total + candidates[i] > target: if total + candidates[i] > target:
break continue
total += candidates[i] total += candidates[i]
path.append(candidates[i]) path.append(candidates[i])
self.backtracking(candidates, target, total, i, path, result) self.backtracking(candidates, target, total, i, path, result)