LeetCode #508. Most Frequent Subtree Sum

关注

原创最新推荐文章于 2022-04-15 09:06:04 发布 227 阅读 AI 写同款· GEO 优化 ›

科技中介如何高效匹配技术供需？.docx 科技中介如何高效匹配技术供需？立即下载

题目描述：

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.

class Solution {
public:
    vector<int> findFrequentTreeSum(TreeNode* root) {
        unordered_map<int,int> count;
        get_subtree_sum(root,count);
        int max_count=0;
        for(auto x:count) max_count=max(max_count,x.second);
        vector<int> result;
        for(auto x:count) if(x.second==max_count) result.push_back(x.first);
        return result;
    }
    
    int get_subtree_sum(TreeNode* node, unordered_map<int,int>& count)
    {
        if(node==NULL) return 0;
        int left=get_subtree_sum(node->left,count);
        int right=get_subtree_sum(node->right,count);
        int sum=left+right+node->val;
        count[sum]++;
        return sum;
    }
};

收录于