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

0112.路径总和 python 精简递归回溯

Browse Source 
0112.路径总和 python 为113精简递归回溯
This commit is contained in:
SianXiaoCHN
2022-03-25 20:23:39 -05:00
parent 9d18d18a3f
commit dd8bea8335
1 changed files with 2 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -504,17 +504,13 @@ class solution:
if cur_node.left: if cur_node.left:
path.append(cur_node.left.val) path.append(cur_node.left.val)
remain -= cur_node.left.val traversal(cur_node.left, remain-cur_node.left.val)
traversal(cur_node.left, remain)
path.pop() path.pop()
remain += cur_node.left.val
if cur_node.right: if cur_node.right:
path.append(cur_node.right.val) path.append(cur_node.right.val)
remain -= cur_node.right.val traversal(cur_node.right, remain-cur_node.left.val)
traversal(cur_node.right, remain)
path.pop() path.pop()
remain += cur_node.right.val
result, path = [], [] result, path = [], []
if not root: if not root: