Commit 0498cf3

authored

补充0102.二叉树的层序遍历.md 515题java解法二

1 parent aacb26d commit 0498cf3Copy full SHA for 0498cf3

File tree

+23

-0

lines changed

+23

-0

lines changed

Lines changed: 23 additions & 0 deletions

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

Comments

(0)