559. Maximum Depth of N-ary Tree

最新推荐文章于 2025-04-05 22:55:03 发布

zeroQiaoba

最新推荐文章于 2025-04-05 22:55:03 发布

阅读量159

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/zeroQiaoba/article/details/104879507

版权

leetcode 专栏收录该内容

429 篇文章

订阅专栏

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