[LeetCode&Python] Problem 559. Maximum Depth of N-ary Tree

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了[LeetCode&Python] Problem 559. Maximum Depth of N-ary Tree，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含971字，纯文字阅读大概需要2分钟。

内容图文

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.

DFS:

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Solution(object):
    def maxDepth(self, root):
        """
        :type root: Node
        :rtype: int
        """
        maxD=0
        
        if root:
            for c in root.children:
                maxD=max(self.maxDepth(c),maxD)
                
            return maxD+1
        return maxD

BFS:

"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
class Solution(object):
    def maxDepth(self, root):
        """
        :type root: Node
        :rtype: int
        """
        
        queue=[root]
        de=0
        
        if root:
            while queue:
                de+=1
                for i in range(len(queue)):
                    node=queue.pop(0)
                    for c in node.children:
                        queue.append(c)
        
        return de

内容总结

以上是互联网集市为您收集整理的[LeetCode&Python] Problem 559. Maximum Depth of N-ary Tree全部内容，希望文章能够帮你解决[LeetCode&Python] Problem 559. Maximum Depth of N-ary Tree所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端