Commit cf0affd

committed

添加 0509.斐波那契数.md Scala版本

1 parent fe3aa4f commit cf0affdCopy full SHA for cf0affd

File tree

+29

-1

lines changed

+29

-1

lines changed

Lines changed: 29 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -245,7 +245,7 @@ var fib = function(n) {`
`245`	`245`	`};`
`246`	`246`	```
`247`	`247`
`248`		`-TypeScript`
	`248`	`+### TypeScript`
`249`	`249`
`250`	`250`	```typescript
`251`	`251`	`function fib(n: number): number {`
`@@ -324,5 +324,33 @@ pub fn fib(n: i32) -> i32 {`
`324`	`324`	`return fib(n - 1) + fib(n - 2);`
`325`	`325`	`}`
`326`	`326`	```
	`327`	`+`
	`328`	`+### Scala`
	`329`	`+`
	`330`	`+动态规划:`
	`331`	+```scala
	`332`	`+object Solution {`
	`333`	`+ def fib(n: Int): Int = {`
	`334`	`+ if (n <= 1) return n`
	`335`	`+ var dp = new Array[Int](n + 1)`
	`336`	`+ dp(1) = 1`
	`337`	`+ for (i <- 2 to n) {`
	`338`	`+ dp(i) = dp(i - 1) + dp(i - 2)`
	`339`	`+ }`
	`340`	`+ dp(n)`
	`341`	`+ }`
	`342`	`+}`
	`343`	+```
	`344`	`+`
	`345`	`+递归:`
	`346`	+```scala
	`347`	`+object Solution {`
	`348`	`+ def fib(n: Int): Int = {`
	`349`	`+ if (n <= 1) return n`
	`350`	`+ fib(n - 1) + fib(n - 2)`
	`351`	`+ }`
	`352`	`+}`
	`353`	+```
	`354`	`+`
`327`	`355`	`-----------------------`
`328`	`356`	`<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>`

Comments

(0)