Leetcode刷题记录——剑指 Offer 34. 二叉树中和为某一值的路径

递归即可

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None

class Solution:
    def __init__(self):
        self.res = []
    def pathSum(self, root: TreeNode, sum: int) -> List[List[int]]:
        if root == None:
            return []
        self.rec(root,0,sum,[])
        return self.res
    def rec(self,root,val,suma,queue):
        if root == None:
            return 0
        if root.val + val == suma and root.left == None and root.right == None:
            self.res.append(queue+[root.val])
        self.rec(root.left,val+root.val,suma,queue+[root.val])
        self.rec(root.right,val+root.val,suma,queue+[root.val])