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

test

Browse Source
This commit is contained in:
Shuai
2024-03-23 15:50:42 +08:00
parent 253bddcf37
commit 12bc134af8
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
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:
continue break
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)
@ -664,4 +664,3 @@ public class Solution
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/> <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a> </a>