algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-10 20:40:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

update 0102.二叉树的层序遍历.md 515java解法二format

Browse Source
This commit is contained in:
binglu18
2021-08-20 16:10:24 +08:00
committed by GitHub
parent 8aafc86193
commit 07d27158b2
1 changed files with 6 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
problems/0102.二叉树的层序遍历.md
View File

@ -1078,16 +1078,17 @@ class Solution {
public List<Integer> largestValues(TreeNode root) { public List<Integer> largestValues(TreeNode root) {
Queue<TreeNode> queue = new LinkedList<TreeNode>(); Queue<TreeNode> queue = new LinkedList<TreeNode>();
List<Integer> result = new ArrayList<>(); List<Integer> result = new ArrayList<>();
if (root!=null) queue.add(root); if (root != null) queue.add(root);
while(!queue.isEmpty()){ while(!queue.isEmpty()){
int size = queue.size(); int size = queue.size();
int max = Integer.MIN_VALUE; // 初始化为最小值 int max = Integer.MIN_VALUE; // 初始化为最小值
for(int i=0;i<size;i++){ for(int i = 0; i < size; i++){
TreeNode node = queue.poll(); TreeNode node = queue.poll();
max = Math.max(node.val,max); max = Math.max(node.val, max);
if(node.left!=null) if(node.left != null)
queue.add(node.left); queue.add(node.left);
if(node.right!=null) if(node.right != null)
queue.add(node.right); queue.add(node.right);
} }
result.add(max); // 取最大值放进数组 result.add(max); // 取最大值放进数组