一、题目地址
二、思路地址
https://www.bilibili.com/video/BV1v5411s717
三、具体代码
/*
* function TreeNode(x) {
* this.val = x;
* this.left = null;
* this.right = null;
* }
*/
/**
*
* @param root TreeNode类
* @return int整型二维数组
*/
// 使用队列的先进先出结构
function levelOrder( root ) {
if(!root) return [];
let res = [];//存放结果的数组
let queue = [root];
while(queue.length) {
let subRes = [];//每一层的子数组
let len = queue.length;
for(let i=0; i<len; i++) {
let temp = queue.shift();
subRes.push(temp.val);
if(temp.left) queue.push(temp.left);
if(temp.right) queue.push(temp.right);
}
res.push(subRes);
}
return res;
}
module.exports = {
levelOrder : levelOrder
};