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.

// Author: Huahua
// Running time: 18 ms
class Solution {
public:
  vector<int> findFrequentTreeSum(TreeNode* root) {
    unordered_map<int, int> freqs;
    int max_freq = -1;
    vector<int> ans;
    (void)treeSum(root, freqs, max_freq, ans);
    return ans;
  }
private:
  int treeSum(TreeNode* root, unordered_map<int, int>& freqs, int& max_freq, vector<int>& ans) {
    if (!root) return 0;
    int sum = root->val + 
              treeSum(root->left, freqs, max_freq, ans) + 
              treeSum(root->right, freqs, max_freq, ans);
    int freq = ++freqs[sum];
    if (freq > max_freq) {
      max_freq = freq;
      ans.clear();
    }
    if (freq == max_freq)
      ans.push_back(sum);
    return sum;
  }
};

Python

"""
Author: Huahua
Running time: 72 ms (beats 100%)
"""
class Solution:
  def findFrequentTreeSum(self, root):   
    if not root: return []
    
    def treeSum(root):
      if not root: return 0
      s = root.val + treeSum(root.left) + treeSum(root.right)
      f[s] += 1   
      return s
    f = collections.Counter()
    treeSum(root)    
    max_freq = max(f.values())        
    return [s for s in f.keys() if f[s] == max_freq]

The post 花花酱 LeetCode 508. Most Frequent Subtree Sum appeared first on Huahua's Tech Road.