-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
47 lines (41 loc) · 1.17 KB
/
Main.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
package com.company;
import java.util.ArrayList;
import java.util.HashMap;
class TreeNode {
int val;
TreeNode left;
TreeNode right;
TreeNode() {}
TreeNode(int val) { this.val = val; }
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
public class Main {
public static void main(String[] args) {
// write your code here
}
int max = 0;
public int[] findMode(TreeNode root) {
HashMap<Integer, Integer> map = new HashMap<>();
dfs(root, map);
ArrayList<Integer> res = new ArrayList<>();
for (var kv: map.entrySet()) {
if(kv.getValue() == max)
res.add(kv.getKey());
}
return res.stream().mapToInt(x -> x).toArray();
}
public void dfs(TreeNode node, HashMap<Integer, Integer> map){
if(node == null) return;
dfs(node.left, map);
if(!map.containsKey(node.val))
map.put(node.val, 1);
else
map.put(node.val, map.get(node.val) + 1);
max = Math.max(max, map.get(node.val));
dfs(node.right, map);
}
}