Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f5c5a58

Browse files
committed
添加 111.二叉树的最小深度 Scala版本
1 parent 32f0599 commit f5c5a58

File tree

1 file changed

+24
-0
lines changed

1 file changed

+24
-0
lines changed

‎problems/0102.二叉树的层序遍历.md‎

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2403,6 +2403,30 @@ func minDepth(_ root: TreeNode?) -> Int {
24032403
}
24042404
```
24052405

2406+
Scala:
2407+
```scala
2408+
// 111.二叉树的最小深度
2409+
object Solution {
2410+
import scala.collection.mutable
2411+
def minDepth(root: TreeNode): Int = {
2412+
if (root == null) return 0
2413+
var depth = 0
2414+
val queue = mutable.Queue[TreeNode]()
2415+
queue.enqueue(root)
2416+
while (!queue.isEmpty) {
2417+
depth += 1
2418+
val len = queue.size
2419+
for (i <- 0 until len) {
2420+
val curNode = queue.dequeue()
2421+
if (curNode.left != null) queue.enqueue(curNode.left)
2422+
if (curNode.right != null) queue.enqueue(curNode.right)
2423+
if (curNode.left == null && curNode.right == null) return depth
2424+
}
2425+
}
2426+
depth
2427+
}
2428+
}
2429+
```
24062430

24072431
# 总结
24082432

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /