559. Maximum Depth of N-ary Tree Python代码

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:

The depth of the tree is at most 1000.
The total number of nodes is at most 5000.

@author ncepu_David
"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
#非递归实现：
from Queue import *
class Solution(object):
    def maxDepth(self, root):
        """
        :type root: Node
        :rtype: int
        """
        depth=0
        if root is None:
            return 0
        queue=Queue()
        nodeset=set()
        queue.put(root)
        nodeset.add(root)
        while not queue.empty():
            depth=depth+1		#统计层数，放在for循环外
            for i in range(queue.qsize()):	#统计每层的节点数，比如第一层只有根节点就是1；第二层是3 2 4，就是3；以此实现层数的统计，遍历完每一次使depth加1.
                cur=queue.get()
                for children in cur.children:
                    if children not in nodeset:
                        nodeset.add(children)
                        queue.put(children)
        return depth
——————————————————————————————————————————————————————————————————————————————
#递归实现：
@author ncepu_David
"""
# Definition for a Node.
class Node(object):
    def __init__(self, val, children):
        self.val = val
        self.children = children
"""
from Queue import *
class Solution(object):
    def maxDepth(self, root):
        """
        :type root: Node
        :rtype: int
        """
        if not root: 
            return 0
        if not root.children: 
            return 1
        max_depth = 0
        for child in root.children:
            cur_depth = self.maxDepth(child)
            if cur_depth > max_depth: max_depth=cur_depth  #要保存下来经过中间若干个节点的深度，比较选出最深的。不比较这一步的话，只能保存下来经过的最后一个节点的树高
        return max_depth + 1