[LeetCode] Most Frequent Subtree Sum 出现频率最高的子树和
Posted Grandyang
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[LeetCode] Most Frequent Subtree Sum 出现频率最高的子树和相关的知识,希望对你有一定的参考价值。
Given the root of a tree, you are asked to find the most frequent subtree sum. 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). So what is the most frequent subtree sum value? If there is a tie, return all the values with the highest frequency in any order.
Examples 1
Input:
5 / 2 -3
return [2, -3, 4], since all the values happen only once, return all of them in any order.
Examples 2
Input:
5 / 2 -5
return [2], since 2 happens twice, however -5 only occur once.
Note: You may assume the sum of values in any subtree is in the range of 32-bit signed integer.
s
以上是关于[LeetCode] Most Frequent Subtree Sum 出现频率最高的子树和的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode - Most Frequent Subtree Sum
[leetcode-508-Most Frequent Subtree Sum]
Leetcode 508. Most Frequent Subtree Sum
[LeetCode] Most Frequent Subtree Sum 出现频率最高的子树和