Lstmxx的空间

515. 在每个树行中找最大值

您需要在二叉树的每一行中找到最大的值。

链接

/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     val: number
 *     left: TreeNode | null
 *     right: TreeNode | null
 *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *         this.val = (val===undefined ? 0 : val)
 *         this.left = (left===undefined ? null : left)
 *         this.right = (right===undefined ? null : right)
 *     }
 * }
 */

function largestValues(root: TreeNode | null): number[] {
  let res: number[] = []
  if (root === null) return res
  const nodeQues: TreeNode[] = [root]
  while(nodeQues.length > 0) {
    const nodes = nodeQues.splice(0)
    const len = nodes.length
    let max = -Infinity
    for(let i = 0; i < len; i++) {
      const node = nodes[i]
      max = Math.max(max, node.val)
      if (node.left) {
        nodeQues.push(node.left)
      }
      if (node.right) {
        nodeQues.push(node.right)
      }
    }
    res.push(max)
  }
  return res
};