508. Most Frequent Subtree Sum**

508. Most Frequent Subtree Sum**

https://leetcode.com/problems/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.

C++ 实现 1

后序遍历的方式求出每个 subtree 的 sum, 并用哈希表记录下每个 sum 出现的频次, 最后返回出现次数最多的 sum.

class Solution {
private:
    unordered_map<int, int> record;
    int subtreeSum(TreeNode *root) {
        if (!root) return 0;
        auto l = subtreeSum(root->left);
        auto r = subtreeSum(root->right);
        int sum = l + r + root->val;
        record[sum] ++;
        return sum;
    }
public:
    vector<int> findFrequentTreeSum(TreeNode* root) {
        subtreeSum(root);
        int freq = 0;
        vector<int> res;
        for (auto &p : record) {
            if (p.second > freq) {
                freq = p.second;
                res = {p.first};
            } else if (p.second == freq) {
                res.push_back(p.first);
            }
        }
        return res;
    }
};