From e1e695e78d3fbba5ebf01fe1be69c6569f9a035a Mon Sep 17 00:00:00 2001
From: fw_qaq <fwqaaq@gmail.com>
Date: Sun, 9 Apr 2023 23:11:11 +0800
Subject: [PATCH] =?UTF-8?q?Update=200509.=E6=96=90=E6=B3=A2=E9=82=A3?=
 =?UTF-8?q?=E5=A5=91=E6=95=B0.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0509.斐波那契数.md | 32 +++++++++++++++++++-------------
 1 file changed, 19 insertions(+), 13 deletions(-)

diff --git a/problems/0509.斐波那契数.md b/problems/0509.斐波那契数.md
index 08175058..479b36a0 100644
--- a/problems/0509.斐波那契数.md
+++ b/problems/0509.斐波那契数.md
@@ -347,26 +347,32 @@ int fib(int n){
 ### Rust
 动态规划:
 ```Rust
-pub fn fib(n: i32) -> i32 {
-    let n = n as usize;
-    let mut dp = vec![0; 31];
-    dp[1] = 1;
-    for i in 2..=n {
-        dp[i] = dp[i - 1] + dp[i - 2];
+impl Solution {
+    pub fn fib(n: i32) -> i32 {
+        if n <= 1 {
+            return n;
+        }
+        let n = n as usize;
+        let mut dp = vec![0; n + 1];
+        dp[1] = 1;
+        for i in 2..=n {
+            dp[i] = dp[i - 2] + dp[i - 1];
+        }
+        dp[n]
     }
-    dp[n]
 }
 ```
 
 递归实现：
 ```Rust
-pub fn fib(n: i32) -> i32 {
-    //若n小于等于1，返回n
-    f n <= 1 {
-        return n;
+impl Solution {
+    pub fn fib(n: i32) -> i32 {
+        if n <= 1 {
+            n
+        } else {
+            Self::fib(n - 1) + Self::fib(n - 2)
+        }
     }
-    //否则返回fib(n-1) + fib(n-2)
-    return fib(n - 1) + fib(n - 2);
 }
 ```