LeetCode-Binary Tree Level Order Traversal II
来源:互联网 发布:sql的delete 编辑:程序博客网 时间:2024/06/01 09:36
唯一和上一个题不同的就是要倒序输出层,从底层开始。只需要改一个小地方就是最后将每层list add到大list时候,用add(0,list),即add到第一位。
public class Solution { public List<List<Integer>> levelOrderBottom(TreeNode root) { Queue<TreeNode> que = new LinkedList<TreeNode>(); List<List<Integer>> ans = new ArrayList<List<Integer>>(); if(root == null) return ans; que.offer(root); while( !que.isEmpty()){ int num = que.size(); List<Integer> list = new ArrayList<Integer>(); for( int i = 0; i < num; i++ ){ if(que.peek().left!= null) que.offer(que.peek().left); if(que.peek().right != null) que.offer(que.peek().right); list.add(que.poll().val); } ans.add(0,list); } return ans; }}
0 0
- LeetCode: Binary Tree Level Order Traversal II
- [LeetCode]Binary Tree Level Order Traversal II
- LeetCode Binary Tree Level Order Traversal II
- [Leetcode] Binary Tree Level Order Traversal II
- LeetCode Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- 【leetcode】Binary Tree Level Order Traversal II
- [LeetCode]Binary Tree Level Order Traversal II
- [Leetcode]Binary Tree Level Order Traversal II
- [leetcode]Binary Tree Level Order Traversal II
- LeetCode-Binary Tree Level Order Traversal II
- LeetCode - Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- LeetCode | Binary Tree Level Order Traversal II
- LeetCode - Binary Tree Level Order Traversal II
- 【leetcode】Binary Tree Level Order Traversal II
- 【LeetCode】Binary Tree Level Order Traversal II
- [LeetCode] Binary Tree Level Order Traversal II
- Myeclipse优化设置,加速你的开发武器
- 【编程之旅】一段大牛写的"奇幻代码"
- C语言变量取值范围
- Android应用打破65K方法数限制
- 10个有趣但毫无用处的Linux命令
- LeetCode-Binary Tree Level Order Traversal II
- 算法训练 安慰奶牛 (Kruscal算法求最小生成树)
- 理解网络基础
- transfrom属性
- Memcache基础教程
- socket()函数介绍
- Android 各种时间格式转换
- 【PAT】1024. Palindromic Number (25)
- Ant模板