429. N-ary Tree Level Order Traversal - LeetCode
Question
429. N-ary Tree Level Order Traversal
Solution
题目大意:
N叉树,返回每层的值,从上到下,从左到右
思路:
利用队列遍历这个N叉树
Java实现:
public List<List<Integer>> levelOrder(Node root) {// N叉树的遍历List<List<Integer>> retList = new ArrayList<>();if (root == null) return retList;Queue<Node> nodeQueue = new LinkedList<>();nodeQueue.offer(root);while(!nodeQueue.isEmpty()) {List<Integer> layerNodeList = new ArrayList<>();int curLayerSize = nodeQueue.size();for (int i = 0; i < curLayerSize; i++) {Node cur = nodeQueue.poll();layerNodeList.add(cur.val);if (cur.children != null) {for (Node tmp : cur.children) {nodeQueue.offer(tmp);}}}retList.add(layerNodeList);}return retList;
}
转载于:https://www.cnblogs.com/okokabcd/p/9579354.html
429. N-ary Tree Level Order Traversal - LeetCode相关推荐
- 429. N-ary Tree Level Order Traversal**
429. N-ary Tree Level Order Traversal** https://leetcode.com/problems/n-ary-tree-level-order-travers ...
- LeetCode: 107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
- [LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)
目录: 1.Binary Tree Level Order Traversal - 二叉树层次遍历 BFS 2.Binary Tree Level Order Traversal II - 二叉树层次 ...
- LeetCode 107. Binary Tree Level Order Traversal II
LeetCode 107. Binary Tree Level Order Traversal II Solution1:我的答案 比102那道题多了一行代码... /*** Definition f ...
- 107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
- 102. Binary Tree Level Order Traversal
题目 Binary Tree Level Order Traversal 层次遍历二叉树 链接 Given a binary tree, return the level order traversa ...
- Binary Tree Level Order Traversal II 解题思路
思路: 与Binary Tree Level Order Traversal I 几乎一样.只是最后将结果存放在栈里,然后在栈里再传给向量即可. 再次总结思路: 两个queue,先把第一个放进q1,循 ...
- [Leetcode]@python 107. Binary Tree Level Order Traversal II
题目链接 https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ 题目原文 Given a binary tree, r ...
- LeetCode: 102. Binary Tree Level Order Traversal
题目 Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to rig ...
最新文章
- Android 反编译Apk提取XML文件
- 代码下移快捷键_Intellij IDEA 快捷键大全
- wampserver配置服务
- python列表字典如何提取_怎么提取字典里面的列表里面的字典的value
- .gitignore文件不起作用
- 纹理对象纹理单元纹理目标_网页设计理论:纹理
- MFC源码解读(一)最原始一个MFC程序,手写不用向导
- np.random.seed()
- 10月24日杨力祥老师谈话有感[转]
- win10下硬盘安装(更新)win10
- 奥城大学计算机专业,研究生美国留学双录取院校汇总
- GTK构件 tree_view
- 西门子plc视频教程
- 一位小公司CTO的成长历程
- 深入理解Java虚拟机开篇
- 可视化大屏项目-大屏界面测试点梳理
- 文献阅读 - Poisson Image Editing
- java并行编程_RxJava(十一): 并行编程
- 培训班出来的人后来都怎么样了?(八)
- Git将本地项目推送到远程仓库