LeetCode 508. Most Frequent Subtree Sum (c++)
来源:互联网 发布:国产外设品牌知乎 编辑:程序博客网 时间:2024/04/28 01:50
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 -3return [2, -3, 4], since all the values happen only once, return all of them in any order.
Examples 2
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.
思路一:map + 一个额外的vector用来保存sum的顺序。
class Solution {public: vector<int> findFrequentTreeSum(TreeNode* root) { if (!root) return solution; dfs(root); for (vector<int>::iterator it = order.begin(); it != order.end(); ++it) { int sum = *it; if(sum_map[sum] == max_num) { solution.push_back(sum); sum_map[sum] = 0; } } return solution; } int dfs(TreeNode* root) { if(!root) return 0; int sum = root->val; sum += dfs(root->left); sum += dfs(root->right); order.push_back(sum); ++sum_map[sum]; if(sum_map[sum] > max_num) max_num = sum_map[sum]; return sum; }private: vector<int> solution; vector<int> order; map<int,int> sum_map; int max_num = 0;};
思路二:unordered_map
class Solution {public: vector<int> findFrequentTreeSum(TreeNode* root) { unordered_map<int,int> counts; int maxCount = 0; countSubtreeSums(root, counts, maxCount); vector<int> maxSums; for(const auto& x : counts){ if(x.second == maxCount) maxSums.push_back(x.first); } return maxSums; } int countSubtreeSums(TreeNode *r, unordered_map<int,int> &counts, int& maxCount){ if(r == nullptr) return 0; int sum = r->val; sum += countSubtreeSums(r->left, counts, maxCount); sum += countSubtreeSums(r->right, counts, maxCount); ++counts[sum]; maxCount = max(maxCount, counts[sum]); return sum; }};
阅读全文
0 0
- LeetCode 508. Most Frequent Subtree Sum (c++)
- Leetcode-508. Most Frequent Subtree Sum
- [leetcode] 508. Most Frequent Subtree Sum
- LeetCode 508. Most Frequent Subtree Sum
- Leetcode 508. Most Frequent Subtree Sum
- leetcode题解-508. Most Frequent Subtree Sum
- [LeetCode]508. Most Frequent Subtree Sum
- LeetCode笔记:508. Most Frequent Subtree Sum
- 【LeetCode】508. Most Frequent Subtree Sum
- Leetcode 508. Most Frequent Subtree Sum
- leetcode 508. Most Frequent Subtree Sum
- leetcode 508. Most Frequent Subtree Sum
- [leetcode]508. Most Frequent Subtree Sum
- [LeetCode] 508. Most Frequent Subtree Sum
- leetcode 508. Most Frequent Subtree Sum
- leetcode 508. Most Frequent Subtree Sum
- [LeetCode] Most Frequent Subtree Sum
- 508. Most Frequent Subtree Sum
- Android启动优化,去除白屏或者黑屏
- C++中string转为char *
- eclipse运行错误提示 Failed to load D:\Android\sdk\build-tools\26.0.0-preview\lib\dx.jar Unknown error: Un
- json-path 解析json 类似xpath 超好用
- centos6.6搭建lnmp开发环境+YII2.0开发环境
- LeetCode 508. Most Frequent Subtree Sum (c++)
- 高并发编程必备基础
- 四级下拉菜单联动
- solr通过url删除数据
- 长宽比 (视频)
- Android热补丁动态修复技术
- theme & style
- HTML前台分页样例
- 最全的jquery datatables api 使用详解