iframe-proxy | Sunbelt Computer Software

36 lines (29 loc) · 738 Bytes

package code;
import java.util.List;
 * 559. Maximum Depth of N-ary Tree
 * 题意：多叉树的最大深度
 * 分类：Tree, Depth-first Search, Breadth-first Search
 * 思路：BFS 也能做和 lc104思路一样
 * Tips：lc104, lc111
public class lc559 {
    class Node {
        public int val;
        public List<Node> children;
        public Node() {}
        public Node(int _val,List<Node> _children) {
            val = _val;
            children = _children;
    public int maxDepth(Node root) {
        if(root==null) return 0;
        int res = 0;
        for (Node nd : root.children) {
            res = Math.max(maxDepth(nd), res);
        return res+1;

Sunbelt Computer Software

PL/B Language Development and Support

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Sunbelt Computer Software

PL/B Language Development and Support

Uh oh!

FilesExpand file tree

lc559.java

Latest commit

History

lc559.java

File metadata and controls