Commit 11f8d34

committed

修正内容错误

1 parent cf32c19 commit 11f8d34Copy full SHA for 11f8d34

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,7 @@`
`22`	`22`
`23`	`23`	`下面我们先来通过一个简单的例子来介绍一下什么是动态规划算法,然后再来讲解动态规划中的各种术语。`
`24`	`24`
`25`		`-> 斐波那契数列:数列由 $f(0) = 1, f(1) = 2$ 开始,后面的每一项数字都是前面两项数字的和。也就是:`
	`25`	`+> 斐波那契数列:数列由 $f(0) = 0, f(1) = 1$ 开始,后面的每一项数字都是前面两项数字的和。也就是:`
`26`	`26`	`>`
`27`	`27`	`> $f(n) = \begin{cases} 0 & n = 0 \cr 1 & n = 1 \cr f(n - 2) + f(n - 1) & n > 1 \end{cases}$`
`28`	`28`

Comments

(0)