一、题目描述
输入一颗二叉树的跟节点和一个整数,打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。(注意: 在返回值的list中,数组长度大的数组靠前)
二、代码详解
# -*- coding:utf-8 -*-
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
# 返回二维列表,内部每个列表表示找到的路径
def FindPath(self, root, expectNumber):
# root为空
if not root:
return []
# 只有root
if root.left == None and root.right == None:
if expectNumber == root.val:
return [[root.val]] #!!
else:
return []
stack = []
leftStack = self.FindPath(root.left, expectNumber - root.val)
for i in leftStack:
i.insert(0, root.val)
stack.append(i)
rightStack =self.FindPath(root.right, expectNumber - root.val)
for i in rightStack:
i.insert(0, root.val)
stack.append(i)
return stack
DFS
# -*- coding:utf-8 -*-
class TreeNode:
def __init__(self, x):
self.val = x
self.left = None
self.right = None
class Solution:
# 返回二维列表,内部每个列表表示找到的路径
def FindPath(self, root, expectNumber):
ret = []
if not root:
return ret
path = [root]
sums = [root.val]
def dfs(root):
if root.left:
path.append(root.left)
sums.append(sums[-1]+root.left.val)
dfs(root.left)
if root.right:
path.append(root.right)
sums.append(sums[-1] + root.right.val)
dfs(root.right)
if not root.left and not root.right:
if sums[-1] == expectNumber:
ret.append([p.val for p in path])
path.pop()
sums.pop()
dfs(root)
return ret