leetcode每日一题第142天

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

    Node() {}

    Node(int _val) {
        val = _val;
    }

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

class Solution {
public:
    int maxDepth(Node* root) {
        if(!root) return 0;
        queue<Node *> q;
        int depth = 0;
        q.push(root);
        while(!q.empty())
        {
            int len = q.size();
            depth++;
            for(int i = 0;i<len;i++)
            {
                Node* tmp = q.front();
                q.pop();
                for(auto node:tmp->children)
                {
                    if(node)
                    {
                        q.push(node);
                    }
                }
            }
            
        }
        return depth;
    }
};