Merge pull request #1528 from DarrenRuan/patch-1

Update 0039.组合总和.md
2022-07-18 09:14:35 +08:00 · 2022-07-18 09:14:35 +08:00 · 1d36a04da6
parent 7d3a585ff6 6f3dc1e6f8
commit 1d36a04da6
1 changed files with 1 additions and 1 deletions
--- a/problems/0039.组合总和.md
+++ b/problems/0039.组合总和.md
@ -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()        # 回溯
 ```