Most Frequent Subtree Sum问题及解法
来源:互联网 发布:.name域名是什么 编辑:程序博客网 时间:2024/05/18 17:01
问题描述:
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.
示例:
Input:
5 / \2 -3return [2, -3, 4], since all the values happen only once, return all of them in any order.
Input:
5 / \2 -5return [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.
问题分析:
将每棵树及子树的和都保存到hash表中,并记录出现次数最多的和,最后遍历hash表,即可找到答案。
过程详见代码:
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solution {public: int maxi;vector<int> findFrequentTreeSum(TreeNode* root) {unordered_map<int, int> m;vector<int> res; maxi = 0;bl(m, root);for (auto c : m){if (c.second == maxi)res.emplace_back(c.first);}return res;}int bl(unordered_map<int, int>& m, TreeNode* root){if (root == nullptr) return 0;int sum = bl(m, root->left) + bl(m, root->right) + root->val;if (!m.count(sum)) m[sum] = 1;else m[sum]++;maxi = max(maxi, m[sum]);return sum;} };
阅读全文
0 0
- Most Frequent Subtree Sum问题及解法
- Most Frequent Subtree Sum
- Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- leetcode508 Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- [LeetCode] Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- Leetcode-508. Most Frequent Subtree Sum
- [leetcode] 508. Most Frequent Subtree Sum
- 系统与管理命令--User和Group类
- $GLOBALS['HTTP_RAW_POST_DATA'] 和$_POST的区别
- Azkaban学习笔记 --- Azkaban调研笔记
- virtualenv在windows10下面使用的注意事项
- 九大排序算法
- Most Frequent Subtree Sum问题及解法
- 关注民生民情——华北水利水电大学“情艺”国情社情调查
- 2、粘包现象(struct模块)
- HDU 3829 Cat VS Dog(二分图最大独立集)
- gcc编译C和C++程序
- iOS管理对象内存的数据结构以及操作算法--SideTables、RefcountMap、weak_table_t-一
- Job:前端基础
- 手机获取验证码 ---SMS
- IO体系图