[LeetCode]Maximum Depth of N-ary Tree@Python

最新推荐文章于 2024-09-30 14:51:11 发布

Goofiness

最新推荐文章于 2024-09-30 14:51:11 发布

阅读量159

点赞数

分类专栏： leetcode 递归文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/89526314

版权

leetcode 同时被 2 个专栏收录

232 篇文章 0 订阅

订阅专栏

递归

5 篇文章 0 订阅

订阅专栏

Maximum Depth of N-ary Tree

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.

Solution

"""
# Definition for a Node.
class Node:
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Solution:
    def maxDepth(self, root: 'Node') -> int:
        if not root:
            return 0
        if not root.children:
            return 1
        return max(self.maxDepth(child) for child in root.children)+1