编程问题:
给定一个 N 叉树,找到其最大深度。最大深度是指从根节点到最远叶子节点的最长路径上的节点总数。N 叉树输入按层序遍历序列化表示,每组子节点由空值分隔(请参见示例)。
示例:
- 输入:root = [1,null,3,2,4,null,5,6]
输出:3 - 输入:root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
输出:5
解法:
1.递归
时间复杂度O(N)
空间复杂度O(N)
/*
// 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)
return 0;
int max = 0, temp = 0;
for (int i = 0; i < root->children.size(); i++)
{
temp = maxDepth(root->children[i]);
if (max < temp)
max = temp;
}
return max + 1;
}
};
2.迭代
利用队列进行层次遍历,遍历一层,就让depth自增1
时间复杂度O(N)
空间复杂度O(N)
/*
// 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)
return 0;
queue<Node *> que;
que.push(root);
int depth = 0;
while (!que.empty())
{
depth++;
int size = que.size();
for (int i = 0; i < size; i++)
{
Node *cur = que.front();
que.pop();
if (cur->children.size())
for (Node *x : cur->children)
que.push(x);
}
}
return depth;
}
};