首页 > 代码库 > [leetcode-508-Most Frequent Subtree Sum]
[leetcode-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记录结点的sum与出现的次数。
int sumofTree(TreeNode* root, map<int, int>&counts, int & maxcount) { if (root == NULL)return 0; int sum = root->val; sum += sumofTree(root->left, counts, maxcount); sum += sumofTree(root->right, counts, maxcount); counts[sum]++; maxcount = max(maxcount, counts[sum]); return sum; } vector<int> findFrequentTreeSum(TreeNode* root) { vector<int>ret; map<int, int>counts; int maxcount = 0; sumofTree(root, counts, maxcount); for (auto it = counts.begin(); it != counts.end();it++) { if (it->second == maxcount)ret.push_back(it->first); } return ret; }
参考：
https://discuss.leetcode.com/topic/77763/short-clean-c-o-n-solution
[leetcode-508-Most Frequent Subtree Sum]
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。