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
| class Solution {
private static class State {
private int level;
private int maxSum;
}
public int maxLevelSum(TreeNode root) {
State state = new State();
state.level = 1;
state.maxSum = root.val;
Queue<TreeNode> queue = new LinkedList<>();
queue.offer(root);
int level = 1;
while (!queue.isEmpty()) {
int sum = 0;
for (int i = queue.size(); i > 0; i--) {
TreeNode node = queue.poll();
sum += node.val;
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
if (sum > state.maxSum) {
state.level = level;
state.maxSum = sum;
}
level++;
}
return state.level;
}
}
|
References
1161. Maximum Level Sum of a Binary Tree