对每一个分支进行DFS,计算每个分支的长度,每次都进行大小比较,最后输出最大的
只是 int tem=maxDepth(root->children[i]);
if(tem>max)
max=tem;
这一段,我最开始写if(max<maxDepth(root->children[i]))
max=maxDepth(root->children[i]);
显示超时。感觉没啥区别的
/*
// Definition for a Node.
class Node {
public:
int val;
vector<Node*> children;
Node() {}
Node(int _val) {
val = _val;
}
Node(int _val, vector<Node*> _children) {
val = _val;
children = _children;
}
};
/
class Solution {
public:
int maxDepth(Node root)
{
if(root==NULL) return 0;
int max=0;
for(int i=0;i<root->children.size();i++)
{
int tem=maxDepth(root->children[i]);
if(tem>max)
max=tem;
}
return max+1;
}
};