<medium>LeetCode Problem -- 508. 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.

• 分析：题目给出一棵二叉树，要求找出这棵二叉树频率最高的节点和。一个节点的节点和可以被表示为左节点和右节点之和。
• 思路一：用递归计算每个节点对应的节点和，将节点和存入一个map中，同时每次通过比较找出最大值，最后通过寻找这个最大值在second出现的位置来进行判断。

class Solution {
public:
    vector<int> findFrequentTreeSum(TreeNode* root) {
        vector<int> res;
        countSum(root);
        for (auto i : my_map) {
            if (i.second == max_num) res.push_back(i.first);
        }
        return res;
    }
private:
    unordered_map<int, int> my_map;
    int max_num = 0;
    int countSum(TreeNode* root) {
        if (root == NULL) return 0;
        int sum = root -> val;
        sum = sum + countSum(root -> left);
        sum = sum + countSum(root -> right);
        my_map[sum]++;
        max_num = max(max_num, my_map[sum]);
        return sum;
    }
};