题目描述:
给定一棵二叉树的根节点 root ,请找出该二叉树中每一层的最大值。
示例1:
输入: root = [1,3,2,5,3,null,9]
输出: [1,3,9]
解释:
1
/ \
3 2
/ \ \
5 3 9
示例2:
输入: root = [1,2,3]
输出: [1,3]
解释:
1
/ \
2 3
示例3:
输入: root = [1]
输出: [1]
示例4:
输入: root = [1,null,2]
输出: [1,2]
解释:
1
\
2
示例5:
输入: root = []
输出: []
var largestValues = function(root) {
if (!root) {
return []
}
let res = []
let queue = [root]
while (queue.length) {
let length = queue.length;
let curLevel = []
for (let i = 0; i < length; i ++) {
let node = queue.shift()
curLevel.push(node.val)
node.left && queue.push(node.left)
node.right && queue.push(node.right)
}
res.push(maxFunc(curLevel))
}
return res
};
function maxFunc(arr) {
return Math.max(...arr)
}