LeetCode: Find Largest Value in Each Tree Row
2017-03-15 10:27
429 查看
BFS
1 /** 2 * Definition for a binary tree node. 3 * public class TreeNode { 4 * int val; 5 * TreeNode left; 6 * TreeNode right; 7 * TreeNode(int x) { val = x; } 8 * } 9 */ 10 public class Solution { 11 public List<Integer> largestValues(TreeNode root) { 12 List<Integer> ans = new ArrayList<Integer>(); 13 if (root == null) return ans; 14 Queue<TreeNode> queue = new LinkedList<TreeNode>(); 15 queue.add(root); 16 while (queue.isEmpty() != true) { 17 int size = queue.size(); 18 int max = Integer.MIN_VALUE; 19 for (int i = 0; i < size; i++) { 20 TreeNode node = queue.poll(); 21 max = Math.max(max, node.val); 22 if (node.left != null) queue.add(node.left); 23 if (node.right != null) queue.add(node.right); 24 } 25 ans.add(max); 26 } 27 return ans; 28 } 29 }
相关文章推荐
- [LeetCode]515 Find Largest Value in Each Tree Row(dfs)
- LeetCode 515 Find Largest Value in Each Tree Row(二叉树层序遍历)
- 【LeetCode】Find Largest Value in Each Tree Row 解题报告
- 【LeetCode515 Find Largest Value in Each Tree Row】二叉树每行的最大值
- LeetCode Find Largest Value in Each Tree Row
- LeetCode--Find Largest Value in Each Tree Row
- Leetcode 515 Find Largest Value in Each Tree Row
- 【LEETCODE】 Find Largest Value in Each Tree Row javascript实现
- leetcode 515 Find Largest Value in Each Tree Row C++
- LeetCode:Find Largest Value in Each Tree Row
- [leetcode 515]Find Largest Value in Each Tree Row
- LeetCode——Find Largest Value in Each Tree Row
- LeetCode之Find Largest Value in Each Tree Row
- LeetCode算法问题17 —— Find Largest Value in Each Tree Row
- 算法分析与设计丨第三周丨LeetCode(6)——Find Largest Value in Each Tree Row(Medium)
- LeetCode之Find Largest Value in Each Tree Row(Kotlin)
- leetcode515 Find Largest Value In Each Tree Row Java
- [LeetCode] Find Largest Value in Each Tree Row 找树每行最大的结点值
- Week Training: 515 Find Largest Value in Each Tree Row
- Find Largest Value in Each Tree Row宽度优先遍历算法详解