mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 19:44:45 +08:00
添加 0509.斐波那契数.md Scala版本
This commit is contained in:
@ -245,7 +245,7 @@ var fib = function(n) {
|
||||
};
|
||||
```
|
||||
|
||||
TypeScript
|
||||
### TypeScript
|
||||
|
||||
```typescript
|
||||
function fib(n: number): number {
|
||||
@ -324,5 +324,33 @@ pub fn fib(n: i32) -> i32 {
|
||||
return fib(n - 1) + fib(n - 2);
|
||||
}
|
||||
```
|
||||
|
||||
### Scala
|
||||
|
||||
动态规划:
|
||||
```scala
|
||||
object Solution {
|
||||
def fib(n: Int): Int = {
|
||||
if (n <= 1) return n
|
||||
var dp = new Array[Int](n + 1)
|
||||
dp(1) = 1
|
||||
for (i <- 2 to n) {
|
||||
dp(i) = dp(i - 1) + dp(i - 2)
|
||||
}
|
||||
dp(n)
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
递归:
|
||||
```scala
|
||||
object Solution {
|
||||
def fib(n: Int): Int = {
|
||||
if (n <= 1) return n
|
||||
fib(n - 1) + fib(n - 2)
|
||||
}
|
||||
}
|
||||
```
|
||||
|
||||
-----------------------
|
||||
<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