小黑实习第三天，做了一些打杂的事情，午休抽空的leetcode之旅:687. 最长同值路径-CSDN博客

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

小黑代码

# 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 longestUnivaluePath(self, root: Optional[TreeNode]) -> int:
        # 声明频率字典
        dict_ = collections.defaultdict(int)
        self.max_ = 0
        def dfs(node):
            if not node:
                return

            dfs(node.left)
            dfs(node.right)
            left_len = 0
            right_len = 0
            if node.left and node.left.val == node.val:
                left_len = dict_[node.left]
            if node.right and node.right.val == node.val:
                right_len = dict_[node.right]
            # 计算结点向下最大延伸路径
            dict_[node] = max(left_len, right_len) + 1
            # 更新最大路径值
            path_len = left_len + right_len
            if path_len > self.max_:
                self.max_ = path_len

        dfs(root)

        return self.max_

在这里插入图片描述

深度优先搜索法

# 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 longestUnivaluePath(self, root: Optional[TreeNode]) -> int:
        # 记录最长路径
        self.ans = 0

        def dfs(node):
            if not node:
                return 0
            # 获取左右两侧路径长度
            left_len = dfs(node.left)
            right_len = dfs(node.right)
            # 更新left_len和right_len
            left_len = left_len + 1 if node.left and node.left.val == node.val else 0
            right_len = right_len + 1 if node.right and node.right.val == node.val else 0
            # 更新ans
            self.ans = max(left_len + right_len, self.ans)
            return max(left_len, right_len)
        dfs(root)
        return self.ans