题目描述
输入一颗二叉树的根节点和一个整数,打印出二叉树中结点值的和为输入整数的所有路径。路径定义为从树的根结点开始往下一直到叶结点所经过的结点形成一条路径。(注意: 在返回值的list中,数组长度大的数组靠前)
OK,深度优先搜索 DFS
并且路径的定义为从根节点开始直到叶节点结束 难度不大
链接:https://www.nowcoder.com/questionTerminal/b736e784e3e34731af99065031301bca?answerType=1&f=discussion
来源:牛客网 zhuanghua
在做这一题之前,我们先来看看怎么输出二叉树的从根结点到每个叶子节点的路径。 如: 1234567
1
/ \
2 3
/ \ /
4 5 6
则返回 [[1, 2, 4], [1, 2, 5], [1, 3, 6]],其实就是深度优先遍历。
链接:https://www.nowcoder.com/questionTerminal/b736e784e3e34731af99065031301bca?answerType=1&f=discussion
来源:牛客网
递归解法
# 递归解法
class TreeNode:
def__init__(self, value):
self.val= value
self.left= None
self.right= None
class Solution:
def binaryTreePaths(self, root):
if root ==None:
return []
result = []
self.DFS(root,result, [root.val])
return result
def DFS(self, root, result, path):
if root.left ==None and root.right == None:
result.append(path)
if root.left !=None:
self.DFS(root.left,result, path + [root.left.val])
if root.right!= None:
self.DFS(root.right,result, path + [root.right.val])
非递归解法
class TreeNode:
def __init__(self, value):
self.val= value
self.left= None
self.right= None
class Solution2:
def binaryTreePaths2(self, root):
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:
result.append(path)
if node.left !=None:
stack.append((node.left,path + [node.left.val]))
if node.right!= None:
stack.append((node.right,path + [node.right.val]))
return result
现在再来看这一题,就会发现:其实这一题就是引出所有的从根结点到叶子结点的路径的变形,就在判断条件上多了一个 sum(path) == self.sums。所以,解法如下:
递归
class TreeNode:
def__init__(self, value):
self.val= value
self.left= None
self.right= None
class Solution:
def binaryTreePaths(self, root):
if root ==None:
return []
result = []
self.sums = expectNumber
self.DFS(root,result, [root.val])
return result
def DFS(self, root, result, path):
if root.left ==None and root.right ==None and sum(path) == self.sums:
result.append(path)
if root.left !=None:
self.DFS(root.left,result, path +[root.left.val])
if root.right!= None:
self.DFS(root.right,result, path +[root.right.val])
非递归
class TreeNode:
def __init__(self, value):
self.val= value
self.left= None
self.right= None
class Solution2:
def binaryTreePaths2(self, root):
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.left !=None:
stack.append((node.left,path + [node.left.val]))
if node.right!= None:
stack.append((node.right,path + [node.right.val]))
return result
运行后发现不符合题目中返回值的list中,数组长度大的数组靠前
加上
res.sort(key=lambda i:len(i),reverse = True)
大神简易版(风痕):