zoukankan      html  css  js  c++  java
  • leetcode 559. 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.

    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
            """
            if not root: return 0
            if not root.children: return 1
            depths = [self.maxDepth(node) for node in root.children]
            return max(depths)+1
    

    简化下,

    class Solution(object):
        def maxDepth(self, root):
            if not root: return 0
            if not root.children: return 1
            return max(self.maxDepth(node) for node in root.children) + 1
    

    或者是:

    class Solution(object):
        def maxDepth(self, root):
            return 1 + max([self.maxDepth(n) for n in root.children] + [0]) if root else 0 
    

     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
            """
            if not root: return 0
            ans = 0
            q = [root]
            while q:
                ans += 1
                q = [c for node in q for c in node.children if c]
            return ans
    
  • 相关阅读:
    51Nod1119
    stoi
    坑爹大质数
    USACO07OPEN Cheapest Palindrome
    USACO08NOV Mixed Up Cows
    USACO12FEB Nearby Cows
    SCOI2009 粉刷匠
    USACO16OPEN 248
    POI2014 PTA-Little Bird
    USACO17FEB Why Did the Cow Cross the Road I G
  • 原文地址:https://www.cnblogs.com/bonelee/p/9348464.html
Copyright © 2011-2022 走看看