mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
添加 0070.爬楼梯.md Scala版本
This commit is contained in:
@ -401,6 +401,38 @@ int climbStairs(int n){
|
||||
}
|
||||
```
|
||||
|
||||
### Scala
|
||||
|
||||
```scala
|
||||
object Solution {
|
||||
def climbStairs(n: Int): Int = {
|
||||
if (n <= 2) return n
|
||||
var dp = new Array[Int](n + 1)
|
||||
dp(1) = 1
|
||||
dp(2) = 2
|
||||
for (i <- 3 to n) {
|
||||
dp(i) = dp(i - 1) + dp(i - 2)
|
||||
}
|
||||
dp(n)
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
优化空间复杂度:
|
||||
```scala
|
||||
object Solution {
|
||||
def climbStairs(n: Int): Int = {
|
||||
if (n <= 2) return n
|
||||
var (a, b) = (1, 2)
|
||||
for (i <- 3 to n) {
|
||||
var tmp = a + b
|
||||
a = b
|
||||
b = tmp
|
||||
}
|
||||
b // 最终返回b
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
-----------------------
|
||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||
|
Reference in New Issue
Block a user