leetcode-简单题-559. N 叉树的最大深度

https://leetcode-cn.com/problems/maximum-depth-of-n-ary-tree/
几天没更新博客了，都忘了之前写的内容，这里用的应该是层序遍历来找最大深度，不难。

/*
// 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 int maxDepth(Node root) {
        if(root == null) return 0;
        LinkedList<Node> queue = new LinkedList<>();
        queue.addLast(root);
        int depth = 0;
        while(!queue.isEmpty()){
            depth++;
            int size = queue.size();
            for(int i = 0; i < size; i++){
                Node temp = queue.poll();
                int childrenSize = temp.children.size();
                for(int j = 0; j < childrenSize; j++){
                    queue.addLast(temp.children.get(j));
                }
            }
        }
        return depth;
    }
}