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

Update 0039.组合总和.md

Browse Source 
这里python代码有个注释似乎写错了。原来为`不是i-1`，应该是`不是i+1`.
This commit is contained in:
DarrenRuan
2022-07-16 23:57:33 -04:00
committed by GitHub
parent c75fdf3dae
commit 6f3dc1e6f8
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

@ -291,7 +291,7 @@ class Solution:
for i in range(start_index, len(candidates)): for i in range(start_index, len(candidates)):
sum_ += candidates[i] sum_ += candidates[i]
self.path.append(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] # 回溯 sum_ -= candidates[i] # 回溯
self.path.pop() # 回溯 self.path.pop() # 回溯
``` ```