algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-08 16:54:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

更新 0509.斐波那契数 排版格式修复

Browse Source
This commit is contained in:
jinbudaily
2023-07-26 14:53:34 +08:00
parent 6ed304e9cd
commit b295b12d1a
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
problems/0509.斐波那契数.md
View File

@ -32,9 +32,9 @@ F(n) = F(n - 1) + F(n - 2)，其中 n > 1
* 0 <= n <= 30
# 视频讲解
## 算法公开课
**《代码随想录》算法视频公开课：[手把手带你入门动态规划 | leetcode：509.斐波那契数](https://www.bilibili.com/video/BV1f5411K7mo)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
**[《代码随想录》算法视频公开课](https://programmercarl.com/other/gongkaike.html)：[手把手带你入门动态规划 | leetcode：509.斐波那契数](https://www.bilibili.com/video/BV1f5411K7mo)，相信结合视频在看本篇题解，更有助于大家对本题的理解**。
## 思路
@ -278,7 +278,7 @@ class Solution:
return self.fib(n - 1) + self.fib(n - 2)
```
### Go：
### Go
```Go
func fib(n int) int {
if n < 2 {
@ -479,3 +479,4 @@ public class Solution
<a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a>