1.题目描述:
给定一个N叉树,找到其最大深度。最大深度是指从根节点到最远叶子节点的最长路径上的节点总数。N叉树输入按层序遍历序列化表示,每组子节点由空值分隔(请参见示例)。
2.递归:
/*
// Definition for a Node.
class Node {
public int val;
public List<Node> children;
public Node() {}
public Node(int _val) {
val = _val;
}
public Node(int _val, List<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++) {//从遍历左右子树到遍历所有子节点
max = Math.max(max, maxDepth(root.children.get(i)));
}
return max + 1;
}
}
3.层序遍历:
class Solution {
public int maxDepth(Node root) {
if (root == null) return 0;
int depth = 0;
Queue<Node> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
while (size > 0) {
Node temp = queue.poll();
size--;
if (temp.children != null) {
for (int i = 0; i < temp.children.size(); i++) {
queue.offer(temp.children.get(i));
}
}
}
depth++;
}
return depth;
}
}