Commit 9af80d3

committed

添加 637.二叉树的层平均值 Scala版本

1 parent ba51a49 commit 9af80d3Copy full SHA for 9af80d3

File tree

+24

-0

lines changed

+24

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1006,6 +1006,30 @@ func averageOfLevels(_ root: TreeNode?) -> [Double] {`
`1006`	`1006`	`return result`
`1007`	`1007`	`}`
`1008`	`1008`	```
	`1009`	`+Scala:`
	`1010`	+```scala
	`1011`	`+// 637.二叉树的层平均值`
	`1012`	`+object Solution {`
	`1013`	`+ import scala.collection.mutable`
	`1014`	`+ def averageOfLevels(root: TreeNode): Array[Double] = {`
	`1015`	`+ val res = mutable.ArrayBuffer[Double]()`
	`1016`	`+ val queue = mutable.Queue[TreeNode]()`
	`1017`	`+ queue.enqueue(root)`
	`1018`	`+ while (!queue.isEmpty) {`
	`1019`	`+ var sum = 0.0`
	`1020`	`+ var len = queue.size`
	`1021`	`+ for (i <- 0 until len) {`
	`1022`	`+ var curNode = queue.dequeue()`
	`1023`	`+ sum += curNode.value // 累加该层的值`
	`1024`	`+ if (curNode.left != null) queue.enqueue(curNode.left)`
	`1025`	`+ if (curNode.right != null) queue.enqueue(curNode.right)`
	`1026`	`+ }`
	`1027`	`+ res.append(sum / len) // 平均值即为sum/len`
	`1028`	`+ }`
	`1029`	`+ res.toArray // 最后需要转换为Array,return关键字可以省略`
	`1030`	`+ }`
	`1031`	`+}`
	`1032`	+```
`1009`	`1033`
`1010`	`1034`	`# 429.N叉树的层序遍历`
`1011`	`1035`

Comments

(0)