題目

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.

題目地址

講解

這道題需要對每次層的深度做個記錄，我直接使用結點的val屬性來記錄深度。另外就是給根節點深度置為1的時候有個技巧，設置一個一次性的flag。

Java代碼

/* // Definition for a Node. class Node {public int val;public List<Node> children;public Node() {}public Node(int _val,List<Node> _children) {val = _val;children = _children;} }; */ class Solution {private int result=0;private boolean flag = true;public int maxDepth(Node root) {if(root==null){return result;}if(flag){root.val=1;flag = false;}if(result<root.val){result = root.val;}for(Node node:root.children){node.val = root.val+1;maxDepth(node);}return result;}}

總結

以上是生活随笔為你收集整理的leetcode讲解--559. Maximum Depth of N-ary Tree的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。