Commit 07d2715

authored

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

1 parent 8aafc86 commit 07d2715Copy full SHA for 07d2715

File tree

-5

lines changed

-5

lines changed

Lines changed: 6 additions & 5 deletions

Original file line number	Diff line number	Diff line change
`@@ -1078,16 +1078,17 @@ class Solution {`
`1078`	`1078`	`public List<Integer> largestValues(TreeNode root) {`
`1079`	`1079`	`Queue<TreeNode> queue = new LinkedList<TreeNode>();`
`1080`	`1080`	`List<Integer> result = new ArrayList<>();`
`1081`		`- if (root!=null) queue.add(root);`
	`1081`	`+ if (root != null) queue.add(root);`
	`1082`	`+`
`1082`	`1083`	`while(!queue.isEmpty()){`
`1083`	`1084`	`int size = queue.size();`
`1084`	`1085`	`int max = Integer.MIN_VALUE; // 初始化为最小值`
`1085`		`- for(int i=0;i<size;i++){`
	`1086`	`+ for(int i=0; i <size;i++){`
`1086`	`1087`	`TreeNode node = queue.poll();`
`1087`		`- max = Math.max(node.val,max);`
`1088`		`- if(node.left!=null)`
	`1088`	`+ max = Math.max(node.val,max);`
	`1089`	`+ if(node.left!=null)`
`1089`	`1090`	`queue.add(node.left);`
`1090`		`- if(node.right!=null)`
	`1091`	`+ if(node.right!=null)`
`1091`	`1092`	`queue.add(node.right);`
`1092`	`1093`	`}`
`1093`	`1094`	`result.add(max); // 取最大值放进数组`

Comments

(0)