Commit c922fbc

committed

添加 429.N叉树的层序遍历 Scala版本

1 parent 9af80d3 commit c922fbcCopy full SHA for c922fbc

File tree

+28

-0

lines changed

+28

-0

lines changed

Lines changed: 28 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1274,6 +1274,34 @@ func levelOrder(_ root: Node?) -> [[Int]] {`
`1274`	`1274`	`}`
`1275`	`1275`	```
`1276`	`1276`
	`1277`	`+Scala:`
	`1278`	+```scala
	`1279`	`+// 429.N叉树的层序遍历`
	`1280`	`+object Solution {`
	`1281`	`+ import scala.collection.mutable`
	`1282`	`+ def levelOrder(root: Node): List[List[Int]] = {`
	`1283`	`+ val res = mutable.ListBuffer[List[Int]]()`
	`1284`	`+ if (root == null) return res.toList`
	`1285`	`+ val queue = mutable.Queue[Node]()`
	`1286`	`+ queue.enqueue(root) // 根节点入队`
	`1287`	`+ while (!queue.isEmpty) {`
	`1288`	`+ val tmp = mutable.ListBuffer[Int]() // 存储每层节点`
	`1289`	`+ val len = queue.size`
	`1290`	`+ for (i <- 0 until len) {`
	`1291`	`+ val curNode = queue.dequeue()`
	`1292`	`+ tmp.append(curNode.value) // 将该节点的值加入tmp`
	`1293`	`+ // 循环遍历该节点的子节点,加入队列`
	`1294`	`+ for (child <- curNode.children) {`
	`1295`	`+ queue.enqueue(child)`
	`1296`	`+ }`
	`1297`	`+ }`
	`1298`	`+ res.append(tmp.toList) // 将该层的节点放到结果集`
	`1299`	`+ }`
	`1300`	`+ res.toList`
	`1301`	`+ }`
	`1302`	`+}`
	`1303`	+```
	`1304`	`+`
`1277`	`1305`	`# 515.在每个树行中找最大值`
`1278`	`1306`
`1279`	`1307`	`[力扣题目链接](https://leetcode-cn.com/problems/find-largest-value-in-each-tree-row/)`

Comments

(0)