Leetcode559. N 叉树的最大深度 Maximum Depth of N-ary Tree - Python 递归法

princey2100

已于 2022-10-12 12:15:57 修改

阅读量89

点赞数

分类专栏： Leetcode刷题二叉树力扣文章标签： leetcode 算法

于 2022-10-11 14:15:44 首次发布

本文链接：https://blog.csdn.net/rendalian/article/details/127262600

版权

Leetcode刷题同时被 3 个专栏收录

56 篇文章 1 订阅

订阅专栏

力扣

47 篇文章 0 订阅

订阅专栏

二叉树

35 篇文章 0 订阅

订阅专栏

"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def maxDepth(self, root: 'Node') -> int:
        if not root:
            return 0
        result = []
        self.res = 0
        def traversal(root: 'Node', depth):
            if len(result) == depth: result.append([])
            for ch in root.children:
                if ch: traversal(ch, depth + 1)
            self.res = max(self.res, depth + 1)
        traversal(root, 0)
        return self.res

层序遍历法，递归法

class Solution:
    def maxDepth(self, root: 'Node') -> int:
        if not root: return 0
        return self.getDepth(root)

    def getDepth(self,root: 'Node'):
        if not root: return 0
        depth = 0
        for i in root.children:
            temp = self.getDepth(i)
            depth = max(depth, temp)

        return depth + 1

依次比较所有子树深度法，递归法

"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

class Solution:
    def maxDepth(self, root: 'Node') -> int:
        if not root: return 0
        queue = collections.deque()
        queue.append(root)
        depth = 0
        while queue:
            depth += 1
            for i in range(len(queue)):
                node = queue.popleft()
                for j in node.children:
                    if j: queue.append(j)
        return depth

层序遍历法，迭代法