Commit ba51a49

committed

添加 199.二叉树的右视图 Scala版本

1 parent aafc18e commit ba51a49Copy full SHA for ba51a49

File tree

+25

-0

lines changed

+25

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -750,6 +750,31 @@ func rightSideView(_ root: TreeNode?) -> [Int] {`
`750`	`750`	`}`
`751`	`751`	```
`752`	`752`
	`753`	`+Scala:`
	`754`	+```scala
	`755`	`+// 199.二叉树的右视图`
	`756`	`+object Solution {`
	`757`	`+ import scala.collection.mutable`
	`758`	`+ def rightSideView(root: TreeNode): List[Int] = {`
	`759`	`+ val res = mutable.ListBuffer[Int]()`
	`760`	`+ if (root == null) return res.toList`
	`761`	`+ val queue = mutable.Queue[TreeNode]()`
	`762`	`+ queue.enqueue(root)`
	`763`	`+ while (!queue.isEmpty) {`
	`764`	`+ val len = queue.size`
	`765`	`+ var curNode: TreeNode = null`
	`766`	`+ for (i <- 0 until len) {`
	`767`	`+ curNode = queue.dequeue()`
	`768`	`+ if (curNode.left != null) queue.enqueue(curNode.left)`
	`769`	`+ if (curNode.right != null) queue.enqueue(curNode.right)`
	`770`	`+ }`
	`771`	`+ res.append(curNode.value) // 把最后一个节点的值加入解集`
	`772`	`+ }`
	`773`	`+ res.toList // 最后需要把res转换为List,return关键字可以省略`
	`774`	`+ }`
	`775`	`+}`
	`776`	+```
	`777`	`+`
`753`	`778`	`# 637.二叉树的层平均值`
`754`	`779`
`755`	`780`	`[力扣题目链接](https://leetcode-cn.com/problems/average-of-levels-in-binary-tree/)`

Comments

(0)