559. Maximum Depth of N-ary Tree

Problem

Given a n-ary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Example1

Input: root = [1,null,3,2,4,null,5,6]
Output: 3

Example2

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: 5

Constraints

• The depth of the n-ary tree is less than or equal to 1000.
• The total number of nodes is between [0, 10^4].

Solution

典型的递归，与二叉树的高度类似。
注意递归终止条件中，如果N叉树节点没有子节点，直接返回1。

/*
// 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;
        if(root->children.size() == 0)
            return 1;
        int ret = 0;
        for(int i = 0;i<root->children.size();++i)
        {
            ret = max(ret,maxDepth(root->children[i])+1);
        }

        return ret;
        
        
    }
    

};