Update 0102.二叉树的层序遍历.md

This commit is contained in:
藤露
2021-06-08 10:06:37 +08:00
committed by GitHub
parent a4b7399acb
commit 7aad637540

View File

@ -98,15 +98,13 @@ class Solution:
out_list = [] out_list = []
while quene: while quene:
length = len(queue) # 这里一定要先求出队列的长度不能用range(len(queue))因为queue长度是变化的
in_list = [] in_list = []
for _ in range(len(quene)): for _ in range(length):
node = quene.pop(0) curnode = queue.pop(0) #(默认移除列表最后一个元素)这里需要移除队列最头上的那个
in_list.append(node.val) in_list.append(curnode.val)
if node.left: if curnode.left : queue.append(curnode.left)
quene.append(node.left) if curnode.right: queue.append(curnode.right)
if node.right:
quene.append(node.right)
out_list.append(in_list) out_list.append(in_list)
return out_list return out_list