[LeetCode] 559. Maximum Depth of N-ary Tree_Easy tag: DFS

转载于 2018-08-09 09:00:00 发布 · 42 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Johnsonxiong/p/9446826.html

文章标签：

#数据结构与算法

本文介绍了一个N叉树的最大深度求解方法，通过深度优先搜索递归算法实现。以一个3叉树为例，展示了如何找到从根节点到最远叶节点的最长路径上的节点数，即最大深度。

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.

这个题目就是用DFS recursive啦.

Code:

class Solution:
    def maxDepthNarry(self, root):
        if not root: return 0
        temp = []
        for each in root.children:
            temp.append(self.maxDepthNarry(each))
        return 1 + max(temp + [0])

转载于:https://www.cnblogs.com/Johnsonxiong/p/9446826.html