问题描述
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.
算法简介
通过递归算法计算subtree sum,得到所有的map[sum]=cnt,然后求解。整体算法O(N)。
代码
int cal_sum(TreeNode* root, map<int,int>& result) {
if (root == NULL)
return 0;
int sum = root->val+cal_sum(root->left,result)+cal_sum(root->right,result);
if (result.find(sum) == result.end())
result[sum] = 1;
else
++result[sum];
return sum;
}
vector<int> findFrequentTreeSum(TreeNode* root) {
map<int,int> tmp;
cal_sum(root,tmp);
vector<int> result;
int max_cnt = 0;
for (map<int,int>::iterator iter = tmp.begin();iter != tmp.end();++iter) {
if (iter->second > max_cnt)
max_cnt = iter->second;
}
for (map<int,int>::iterator iter = tmp.begin();iter != tmp.end();++iter){
if (iter->second == max_cnt)
result.push_back(iter->first);
}
return result;
}