Commit 68159f8

authored

Merge pull request youngyangyang04#630 from binglu18/master

补充 0102.二叉树的层序遍历.md java方法二

2 parents 8b0539e + 07d2715 commit 68159f8Copy full SHA for 68159f8

File tree

+26

-0

lines changed

+26

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1072,6 +1072,32 @@ class Solution {`
`1072`	`1072`	`}`
`1073`	`1073`	```
`1074`	`1074`
	`1075`	+```java
	`1076`	`+//方法二:用一个max变量来保存最大值`
	`1077`	`+class Solution {`
	`1078`	`+ public List<Integer> largestValues(TreeNode root) {`
	`1079`	`+ Queue<TreeNode> queue = new LinkedList<TreeNode>();`
	`1080`	`+ List<Integer> result = new ArrayList<>();`
	`1081`	`+ if (root != null) queue.add(root);`
	`1082`	`+`
	`1083`	`+ while(!queue.isEmpty()){`
	`1084`	`+ int size = queue.size();`
	`1085`	`+ int max = Integer.MIN_VALUE; // 初始化为最小值`
	`1086`	`+ for(int i = 0; i < size; i++){`
	`1087`	`+ TreeNode node = queue.poll();`
	`1088`	`+ max = Math.max(node.val, max);`
	`1089`	`+ if(node.left != null)`
	`1090`	`+ queue.add(node.left);`
	`1091`	`+ if(node.right != null)`
	`1092`	`+ queue.add(node.right);`
	`1093`	`+ }`
	`1094`	`+ result.add(max); // 取最大值放进数组`
	`1095`	`+ }`
	`1096`	`+ return result;`
	`1097`	`+ }`
	`1098`	`+}`
	`1099`	+```
	`1100`	`+`
`1075`	`1101`	`go:`
`1076`	`1102`
`1077`	`1103`	```GO

Comments

(0)