[Leetcode] 113. Path Sum Ⅱ

题目

Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.

Note: A leaf is a node with no children.

Example:

Given the below binary tree and sum = 22,

      5
     / \
    4   8
   /   / \
  11  13  4
 /  \    / \
7    2  5   1

Return:

[
   [5,4,11,2],
   [5,8,4,5]
]

思路

使用DFS

 

Python3代码

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

class Solution:
    def pathSum(self, root: TreeNode, sum: int) -> List[List[int]]:
        if not root:
            return []
        self.one = []
        self.res = []
        self.sums = 0
        def search(root, sum):
            if sum - root.val == 0 and root.left is None and root.right is None:
                self.one.append(root.val)
                self.res.append(self.one[:])
                self.one.pop()
                return
            else:
                self.one.append(root.val)
                if root.left is not None:
                    search(root.left, sum-root.val) 
                if root.right is not None:
                    search(root.right, sum-root.val)
                self.one.pop()
        search(root, sum)
        return self.res