Merge pull request #1528 from DarrenRuan/patch-1

Update 0039.组合总和.md
This commit is contained in:
程序员Carl
2022-07-18 09:14:35 +08:00
committed by GitHub

View File

@ -291,7 +291,7 @@ class Solution:
for i in range(start_index, len(candidates)):
sum_ += candidates[i]
self.path.append(candidates[i])
self.backtracking(candidates, target, sum_, i) # 因为无限制重复选取所以不是i-1
self.backtracking(candidates, target, sum_, i) # 因为无限制重复选取所以不是i+1
sum_ -= candidates[i] # 回溯
self.path.pop() # 回溯
```