Update 0102.二叉树的层序遍历.md
This commit is contained in:
parent
1498333afd
commit
10c8c04dd2
|
|
@ -1129,7 +1129,7 @@ var largestValues = function(root) {
|
||||||
queue.push(root);
|
queue.push(root);
|
||||||
while(root!==null&&queue.length){
|
while(root!==null&&queue.length){
|
||||||
//设置max初始值就是队列的第一个元素
|
//设置max初始值就是队列的第一个元素
|
||||||
let max=queue[0];
|
let max=queue[0].val;
|
||||||
let length=queue.length;
|
let length=queue.length;
|
||||||
while(length--){
|
while(length--){
|
||||||
let node = queue.shift();
|
let node = queue.shift();
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue