mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
@ -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 = [], []
|
||||||
|
Reference in New Issue
Block a user