小黑除夕跟尚香吃喜茶喝火锅，走了一下午，晚上休息会儿顺便的leetcode之旅:剑指 Offer 34. 二叉树中和为某一值的路径

爱喝喜茶爱吃烤冷面的小黑黑

已于 2023-01-21 21:00:57 修改

阅读量137

点赞数

分类专栏：小黑的日常leetcode之旅文章标签： leetcode 算法深度优先

于 2023-01-21 21:00:04 首次发布

本文链接：https://blog.csdn.net/qq_37418807/article/details/128747158

版权

小黑的日常leetcode之旅专栏收录该内容

225 篇文章 1 订阅

订阅专栏

小黑代码

# 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: TreeNode, target: int) -> List[List[int]]:
        paths = []
        def dfs(node, path = []):
            # 递归出口
            if not node:
                return
            path.append(node.val)
            # 递归出口
            if not (node.left or node.right) and sum(path) == target:
                paths.append(path[:])
            dfs(node.left)
            dfs(node.right)
            path.pop()
        dfs(root)
        return paths

在这里插入图片描述

层次遍历法

# 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: TreeNode, target: int) -> List[List[int]]:
        if not root:
            return []
        # 初始化队列
        q = collections.deque([root])
        q_sum = collections.deque([root.val])
        # node:parent
        map_ = collections.defaultdict(lambda:None)
        arr = []
        while q:
            # 出队
            top = q.popleft()
            top_num = q_sum.popleft()
            # 判断是否叶子结点并输出结点
            if not (top.left or top.right) and top_num == target:
                arr.append(top)
                continue

            # 入队操作
            if top.left:
                q.append(top.left)
                q_sum.append(top.left.val + top_num)
                map_[top.left] = top
            if top.right:
                q.append(top.right)
                q_sum.append(top.right.val + top_num)
                map_[top.right] = top
        # 输出路径
        results = []
        for node in arr:
            path = []
            while node:
                path.append(node.val)
                node = map_[node]
            results.append(path[::-1])
        return results