剑指 Offer 34. 二叉树中和为某一值的路径
- 输入一棵二叉树和一个整数,打印出二叉树中节点值的和为输入整数的所有路径。从树的根节点开始往下一直到叶节点所经过的节点形成一条路径。
示例:
给定如下二叉树,以及目标和 sum = 22,
5
/ \
4 8
/ / \
11 13 4
/ \ / \
7 2 5 1
返回:
[
[5,4,11,2],
[5,8,4,5]
]
提示:
节点总数 <= 10000
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def pathSum(self, root, sum):
"""
:type root: TreeNode
:type sum: int
:rtype: List[List[int]]
"""
res = []
path = []
def recur(root, tar):
if not root:
return
path.append(root.val)
tar -= root.val
if tar == 0 and not root.left and not root.right:
res.append(path[:])
recur(root.left, tar)
recur(root.right, tar)
path.pop()
recur(root, sum)
return res