-
Notifications
You must be signed in to change notification settings - Fork 7
/
Main.java
55 lines (49 loc) · 1.45 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
48
49
50
51
52
53
54
55
package com.company;
import java.util.ArrayDeque;
import java.util.HashMap;
import java.util.Map;
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) {
TreeNode a = new TreeNode(1);
TreeNode b = new TreeNode(7);
TreeNode c = new TreeNode(0);
TreeNode d = new TreeNode(7);
TreeNode e = new TreeNode(-8);
a.left = b;
a.right = c;
b.left = d;
b.right = e;
maxLevelSum(a);
}
public static int maxLevelSum(TreeNode root) {
Map<Integer, Integer> map = new HashMap<>();
ArrayDeque<TreeNode> queue = new ArrayDeque<>(){{offer(root);}};
int level = 1, max = Integer.MIN_VALUE;
while (!queue.isEmpty()){
int count = queue.size();
int sum = 0;
for (int i = 0; i < count; i++) {
TreeNode cur = queue.poll();
sum += cur.val;
if(cur.left != null) queue.offer(cur.left);
if(cur.right != null) queue.offer(cur.right);
}
max = Math.max(max, sum);
if(!map.containsKey(sum)) map.put(sum, level);
level++;
}
return map.get(max);
}
}