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
| class Solution {
public int maxLevelSum(TreeNode root) {
if (root == null) {
return 0;
}
int max = Integer.MIN_VALUE;
int result = 0;
int level = 0;
LinkedList<TreeNode> queue = new LinkedList<>();
queue.offer(root);
while (queue.size() > 0) {
int n = queue.size();
int count = 0;
level++;
for (int i = 0; i < n; i++) {
TreeNode node = queue.poll();
count += node.val;
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
if (max < count){
max = count;
result = level;
}
}
return result;
}
}
|
