题目链接:https://leetcode.com/problems/maximum-depth-of-n-ary-tree/
题面:
559. Maximum Depth of N-ary Tree
Easy
35920FavoriteShare
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
.
题意:求树深。
代码:
class Solution {
public:
int maxDepth(Node* root) {
if(root==NULL)return 0;
int res=1;
for(int i=0;i<root->children.size();i++){
res=max(res,maxDepth(root->children[i])+1);
}
return res;
}
};