leetcode 429 N叉树的层次遍历

题目

给定一个 N 叉树，返回其节点值的层序遍历。 (即从左到右，逐层遍历)。

代码

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Solution(object):
    def levelOrder(self, root):
        """
        :type root: Node
        :rtype: List[List[int]]
        """
        if root == None:
            return
        res = []
        cur_level = [root]
        while cur_level:
            cur_level_arr = []
            next_level = []
            for n in cur_level:
                cur_level_arr.append(n.val)
                for child in n.children:
                    next_level.append(child)
            res.append(cur_level_arr)
            cur_level = next_level
        return res