559. Maximum Depth of N-ary Tree

Easy

19218

1.题目描述

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.

For example, given a 3-ary tree:

We should return its max depth, which is 3.

Note:

1. The depth of the tree is at most 1000.
2. The total number of nodes is at most 5000

2.题目思路

简单递归，最深的深度 = 目前所在结点孩子结点最深的深度 + 1（该结点到孩子结点的深度）

3.实现代码

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

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    int maxDepth(Node* root) {
        if (root==NULL)
            return 0;
        else {
            int dep = 0;
            for (auto it: root->children)//用来遍历children容器
                dep = max(maxDepth(it),dep);
            dep ++;
            return dep;
        }
    }
};