【2022初春】【LeetCode】【树】429. N 叉树的层序遍历

N叉树层序，无大区别

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public List<List<Integer>> levelOrder(Node root) {
        List<List<Integer>> res = new ArrayList<>();
        if(root==null) return res;
        Queue<Node> q = new LinkedList<>();
        q.add(root);
        int time = 1;
        while(!q.isEmpty()){
            List<Integer> ans = new ArrayList<>();
            int flag = 0;
            for(int i=0; i<time; i++){
                Node node = q.poll();
                ans.add(node.val);
                List<Node> l = node.children;
                for(Node n : l){
                    flag++;
                    q.add(n);
                }
            }
            time = flag;
            res.add(ans);
        }
        return res;
    }
}