559. Maximum Depth of N-ary Tree

最新推荐文章于 2024-09-14 18:52:56 发布

wenyq7

最新推荐文章于 2024-09-14 18:52:56 发布

阅读量109

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/qq_37333947/article/details/128734349

版权

LeetCode 专栏收录该内容

287 篇文章 1 订阅

订阅专栏

给定一个n-ary树，找出其最大深度。最大深度是自根节点到最远叶节点的最长路径上的节点数。文章提供了两种解决方案，一种是使用迭代的广度优先搜索，另一种是递归方法，分别计算每个子节点的最大深度并取最大值。

摘要由CSDN通过智能技术生成

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.

Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Example 1:

Input: root = [1,null,3,2,4,null,5,6]
Output: 3

Example 2:

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: 5

Constraints:

The total number of nodes is in the range [0, 104].
The depth of the n-ary tree is less than or equal to 1000.

就，很简单的maxDepth题，只不过是把之前的binary tree改成了n-ary tree，其实就只是数据结构的表示方式变了，从left/right变成了List，没啥区别。

迭代版，很简单：

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public int maxDepth(Node root) {
        int depth = 0;
        if (root == null) {
            return 0;
        }
        Queue<Node> queue = new LinkedList<>();
        queue.add(root);
        while (!queue.isEmpty()) {
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                Node node = queue.remove();
                for (int j = 0; j < node.children.size(); j++) {
                    queue.add(node.children.get(j));
                }
            }
            depth++;
        }
        return depth;
    }
}

递归版，也挺简单，就是把比较左右变成了list里找最大：

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

class Solution {
    public int maxDepth(Node root) {
        if (root == null) {
            return 0;
        }
        List<Integer> childrenDepth = new ArrayList<>();
        List<Node> children = root.children;
        for (int i = 0; i < children.size(); i++) {
            childrenDepth.add(maxDepth(children.get(i)) + 1);
        }
        int max = 1;
        for (int i : childrenDepth) {
            if (i > max) {
                max = i;
            }
        }
        return max;