LeetCode 508. Most Frequent Subtree Sum

原题链接在这里：https://leetcode.com/problems/most-frequent-subtree-sum/description/

题目：

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.

题解：

自下而上计算每个点的sum, 保存这个sum和对应的count. 更新维护最大的count.

Time Complexity: O(n). Space: O(n). hm size.

AC Java:

 1 /**
 2  * Definition for a binary tree node.
 3  * public class TreeNode {
 4  *     int val;
 5  *     TreeNode left;
 6  *     TreeNode right;
 7  *     TreeNode(int x) { val = x; }
 8  * }
 9  */
10 class Solution {
11     int maxCount;
12     HashMap<Integer, Integer> hm;
13     public int[] findFrequentTreeSum(TreeNode root) {
14         maxCount = 0;
15         hm = new HashMap<Integer, Integer>();
16
17         postOrder(root);
18
19         List<Integer> res= new ArrayList<Integer>();
20         for(Map.Entry<Integer, Integer> entry : hm.entrySet()){
21             if(entry.getValue() == maxCount){
22                 res.add(entry.getKey());
23             }
24         }
25
26         int [] resArr = new int[res.size()];
27         for(int i = 0; i<res.size(); i++){
28             resArr[i] = res.get(i);
29         }
30
31         return resArr;
32     }
33
34     private int postOrder(TreeNode root){
35         if(root == null){
36             return 0;
37         }
38
39         int left = postOrder(root.left);
40         int right = postOrder(root.right);
41         int val = left + right + root.val;
42         hm.put(val, hm.getOrDefault(val, 0)+1);
43         maxCount = Math.max(maxCount, hm.get(val));
44
45         return val;
46     }
47 }

转载于:https://www.cnblogs.com/Dylan-Java-NYC/p/8364876.html

LeetCode 508. Most Frequent Subtree Sum相关推荐

LeetCode—494. 目标和(Target Sum)——分析及代码（Java）
LeetCode-494. 目标和[Target Sum]--分析及代码[Java] 一.题目二.分析及代码 1. 动态规划 (1)思路 (2)代码 (3)结果 2. 动态规划+节省空间 (1)思路 ...
Leetcode | Binary Tree Maximum Path Sum
Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. ...
LeetCode 404. 左叶子之和(Sum of Left Leaves)
404. 左叶子之和 404. Sum of Left Leaves LeetCode404. Sum of Left Leaves 题目描述计算给定二叉树的所有左叶子之和. 示例: 3/ \9 2 ...
[Leetcode] Binary Tree Maximum Path Sum
这是LeetCode上的一道题目,需要求二叉树中两点路径的最大和.原题是 https://oj.leetcode.com/problems/binary-tree-maximum-path-sum/ ...
leetcode 712. Minimum ASCII Delete Sum for Two Strings | 712. 两个字符串的最小ASCII删除和（暴力递归-＞傻缓存-＞DP）
题目 https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings/ 题解经典的暴力递归 -> 傻缓存 -&g ...
leetcode 416. Partition Equal Subset Sum | 416. 分割等和子集（Java）
题目 https://leetcode.com/problems/partition-equal-subset-sum/ 题解乍一看是背包问题,但不同的是,本题要求结果等于某值,背包要求结果小于某值 ...
leetcode 209. Minimum Size Subarray Sum | 209. 长度最小的子数组（Java）
题目 https://leetcode.com/problems/minimum-size-subarray-sum/ 题解双指针解法,左指针和右指针在合适的时候向右走,并维护一个sum 版本1 思 ...
LeetCode 410. Split Array Largest Sum
方法一:DFS+Memoization 某种程度来说本题和 Word Break 很像.直接dfs暴力做肯定会超时,加上memoization即可. dfs(start, m, ...) 表示从ind ...
Leetcode: Top K Frequent Elements
Given a non-empty array of integers, return the k most frequent elements.For example, Given [1,1,1,2 ...

LeetCode 508. Most Frequent Subtree Sum

LeetCode 508. Most Frequent Subtree Sum相关推荐

最新文章

热门文章