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

Update 0216.组合总和III.md

Browse Source
This commit is contained in:
lewiseng
2025-01-25 15:56:17 -05:00
committed by GitHub
parent 5cd1eec4bf
commit 7f5ce0ac41
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0216.组合总和III.md
View File

@ -367,7 +367,7 @@ class Solution:
def backtracking(self, targetSum, k, currentSum, startIndex, path, result): def backtracking(self, targetSum, k, currentSum, startIndex, path, result):
if currentSum > targetSum: # 剪枝操作 if currentSum > targetSum: # 剪枝操作
return # 如果path的长度等于k但currentSum不等于targetSum，则直接返回 return # 如果currentSum已经超过targetSum，则直接返回
if len(path) == k: if len(path) == k:
if currentSum == targetSum: if currentSum == targetSum:
result.append(path[:]) result.append(path[:])