【路径总和 II】python刷题记录

R4-图的回溯

先序遍历 + 路径记录

 

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def pathSum(self, root: Optional[TreeNode], targetSum: int) -> List[List[int]]:
        ret=[]
        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:
                ret.append(list(path))
            recur(root.left,tar)
            recur(root.right,tar)
            path.pop()
        recur(root,targetSum)
        return ret

ps:

记录路径时：