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

一、题目地址

https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/

二、具体代码

/**
 * Definition for a binary tree node.
 * function TreeNode(val, left, right) {
 *     this.val = (val===undefined ? 0 : val)
 *     this.left = (left===undefined ? null : left)
 *     this.right = (right===undefined ? null : right)
 * }
 */
/**
 * @param {TreeNode} root
 * @return {number[]}
 */
// 层序遍历
// 时间复杂度: O(N^2)
// 空间复杂度: O(N)
 var largestValues = function(root) {
    let queue = [];
    let res = [];
    if(root !== null) {
        queue.push(root);
    }
    while(queue.length !== 0) {
        let len = queue.length;
        let tempNum =  -Infinity;
        for(let i=0; i<len; i++) {
            let node = queue.shift();
            tempNum = Math.max(tempNum, node.val);
            if(node.left) {
                queue.push(node.left);
            }
            if(node.right) {
                queue.push(node.right);
            }
        }
        res.push(tempNum);
    }
    return res;
};