LeetCode 508. Most Frequent Subtree Sum

青帆1998

于 2022-04-15 09:06:04 发布

阅读量383

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_43762534/article/details/124187017

LeetCode 专栏收录该内容

34 篇文章

订阅专栏

这是一个关于二叉树问题的解题方案，主要目标是找到树中出现最频繁的子树和。利用递归方法，计算每个节点的子树和，并维护一个字典记录各子树和出现的频率。当找到最大频率时，将对应的和加入答案列表。最后返回最高频率的子树和。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

Given the root of a binary tree, return the most frequent subtree sum. If there is a tie, return all the values with the highest frequency in any order.

The subtree sum of a node is defined as the sum of all the node values formed by the subtree rooted at that node (including the node itself).

解题思路

经典递归问题。

代码

# 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 findFrequentTreeSum(self, root: Optional[TreeNode]) -> List[int]:
        self.d = {}
        self.helper(root)
        mx = max(self.d.values())
        ans = []
        for k in self.d.keys():
            if self.d[k] == mx:
                ans.append(k)
        return ans
    
    def helper(self, root):
        if not root:
            return 0
        left_val = self.helper(root.left)
        right_val = self.helper(root.right)
        total = left_val + right_val + root.val
        if total in self.d.keys():
            self.d[total] += 1 
        else:
            self.d[total] = 1
        return total