0
点赞
收藏
分享

微信扫一扫

LeetCode-559. Maximum Depth of N-ary Tree

上善若水的道 2022-08-10 阅读 63


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:

 

LeetCode-559. Maximum Depth of N-ary Tree_i++

 

We should return its max depth, which is 3.

 

Note:

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

题解:

class Solution {
public:
static void maxDepth(Node* root, int d, int &ans) {
if (root != NULL) {
ans = max(ans, d);
for (int i = 0; i < root->children.size(); i++) {
maxDepth(root->children[i], d + 1, ans);
}
}
}
int maxDepth(Node* root) {
int ans = 0;
maxDepth(root, 1, ans);
return ans;
}
};

 

LeetCode-559. Maximum Depth of N-ary Tree_i++_02

举报

相关推荐

0 条评论