剑指Offer 34 二叉树中和为某一值的路径

思路：dfs + 回溯

注意：如果语句写在递归下面就是回溯，当二叉树遍历完左子树回去的时候就会删除节点

# 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]]:
        res, path = [], []
        def dfs(root, s):
            if not root: return
            path.append(root.val)
            if s == root.val and not root.left and not root.right:
                res.append(list(path))  #需要注意，这里append一个path的拷贝
            dfs(root.left, s-root.val)
            dfs(root.right, s-root.val)
            path.pop()
            return
        dfs(root, sum)
        return res