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

Update 0112.路径总和.md

Browse Source 
1\ return 的位置错误
2\ 第二个traversal的输入值错误
This commit is contained in:
zhywanna
2022-09-11 16:12:58 +08:00
committed by GitHub
parent cc5a2feda3
commit 08169cefbc
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
problems/0112.路径总和.md
View File

@ -499,7 +499,7 @@ class solution:
if not cur_node.left and not cur_node.right: if not cur_node.left and not cur_node.right:
if remain == 0: if remain == 0:
result.append(path[:]) result.append(path[:])
return return
if cur_node.left: if cur_node.left:
path.append(cur_node.left.val) path.append(cur_node.left.val)
@ -508,7 +508,7 @@ class solution:
if cur_node.right: if cur_node.right:
path.append(cur_node.right.val) path.append(cur_node.right.val)
traversal(cur_node.right, remain-cur_node.left.val) traversal(cur_node.right, remain-cur_node.right.val)
path.pop() path.pop()
result, path = [], [] result, path = [], []