代码拉取完成,页面将自动刷新
package com.fishercoder.solutions;
import com.fishercoder.common.classes.Node;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
/**
* 429. N-ary Tree Level Order Traversal
*
* Given an n-ary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
*
* For example, given a 3-ary tree:
*
* 1
* / | \
* 3 2 4
* / \
* 5 6
*
* We should return its level order traversal:
*
* [
* [1],
* [3,2,4],
* [5,6]
* ]
*
*
* Note:
*
* The depth of the tree is at most 1000.
* The total number of nodes is at most 5000.
*/
public class _429 {
public static class Solution1 {
public List<List<Integer>> levelOrder(Node root) {
List<List<Integer>> result = new ArrayList<>();
if (root == null) {
return result;
}
Queue<Node> queue = new LinkedList<>();
queue.offer(root);
while (!queue.isEmpty()) {
int size = queue.size();
List<Integer> level = new ArrayList<>();
for (int i = 0; i < size; i++) {
Node currentNode = queue.poll();
if (currentNode != null) {
level.add(currentNode.val);
for (Node child : currentNode.children) {
queue.offer(child);
}
}
}
result.add(level);
}
return result;
}
}
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。