113. Path Sum II (Medium) - TengnanYao/daily_leetcode GitHub Wiki

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution(object):
    def pathSum(self, root, targetSum):
        """
        :type root: TreeNode
        :type targetSum: int
        :rtype: List[List[int]]
        """
        self.result = []
        def dfs(root, path, s):
            if root:
                s -= root.val
                if not root.left and not root.right and s == 0:
                    self.result.append(path + [root.val])
                else:
                    dfs(root.left, path + [root.val], s)
                    dfs(root.right, path + [root.val], s)
        dfs(root, [], targetSum)
        return self.result