一.题目描述
给定一棵二叉树的根节点 root
,请找出该二叉树中每一层的最大值。
https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/
二.代码
public List<Integer> largestValues(TreeNode root) {
List<Integer> list = new ArrayList<>();
if (root == null) {
return list;
}
Queue<TreeNode> queue = new LinkedList<>();
queue.add(root);
while (!queue.isEmpty()) {
int size = queue.size();
int max = Integer.MIN_VALUE;
for (int i = 0; i < size; i++) {
TreeNode treeNode = queue.poll();
max = Math.max(treeNode.val, max);
if (treeNode.left != null) {
queue.add(treeNode.left);
}
if (treeNode.right != null) {
queue.add(treeNode.right);
}
}
list.add(max);
}
return list;
}
public List<Integer> largestValues(TreeNode root) {
List<Integer> res = new ArrayList<>();
helper(root, res, 1);
return res;
}
private void helper(TreeNode root, List<Integer> res, int level) {
if (root == null) {
return;
}
if (level == res.size() + 1) {
res.add(root.val);
} else {
res.set(level - 1, Math.max(res.get(level - 1), root.val));
}
helper(root.left, res, level + 1);
helper(root.right, res, level + 1);
}