此题的路径是从根到叶子节点,包含这两个本身
前序非递归
class Solution:
# 返回二维列表,内部每个列表表示找到的路径
def FindPath(self, root, expectNumber):
# write code here
# 必须根到叶节点,包括根和叶子节点
# 前序遍历非递归法
if root == None:
return []
result = []
stack = []
stack.append((root, [root.val]))
while stack:
node, path = stack.pop()
# 叶子节点
if node.left == None and node.right == None and sum(path) == expectNumber:
result.append(path)
if node.right != None:
stack.append((node.right, path + [node.right.val]))
if node.left != None:
stack.append((node.left, path + [node.left.val]))
return result
前序递归
class Solution:
# 返回二维列表,内部每个列表表示找到的路径
def FindPath(self, root, expectNumber):
# write code here
# 必须根到叶节点,包括根和叶子节点
# 前序遍历递归法
def dfs(node, path):
if not node: return
if not node.left and not node.right and sum(path) == expectNumber:
res.append(path)
if node.left:
dfs(node.left, path + [node.left.val])
if node.right:
dfs(node.right, path + [node.right.val])
if not root: return []
res = []
dfs(root, [root.val])
return res