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
| class Solution {
public List<Integer> largestValues(TreeNode root) {
List<Integer> resultList = new ArrayList<>();
Queue<TreeNode> queue = new LinkedList<>();
if (root != null) {
queue.offer(root);
}
while (!queue.isEmpty()) {
int largestValue = Integer.MIN_VALUE;
for (int i = queue.size(); i > 0; i--) {
TreeNode node = queue.poll();
largestValue = Math.max(largestValue, node.val);
if (node.left != null) {
queue.offer(node.left);
}
if (node.right != null) {
queue.offer(node.right);
}
}
resultList.add(largestValue);
}
return resultList;
}
}
|
References
515. Find Largest Value in Each Tree Row
剑指 Offer II 044. 二叉树每层的最大值