Finetune Rust code.

codes/rust/chapter_dynamic_programming/climbing_stairs_backtrack.rs

@@ -34,4 +34,4 @@ pub fn main() {
 
     let res = climbing_stairs_backtrack(n);
     println!("爬 {n} 阶楼梯共有 {res} 种方案");
-}
+}

codes/rust/chapter_dynamic_programming/climbing_stairs_constraint_dp.rs

@@ -28,4 +28,4 @@ pub fn main() {
 
     let res = climbing_stairs_constraint_dp(n);
     println!("爬 {n} 阶楼梯共有 {res} 种方案");
-}
+}

codes/rust/chapter_dynamic_programming/climbing_stairs_dfs.rs

@@ -24,4 +24,4 @@ pub fn main() {
 
     let res = climbing_stairs_dfs(n);
     println!("爬 {n} 阶楼梯共有 {res} 种方案");
-}
+}

codes/rust/chapter_dynamic_programming/climbing_stairs_dp.rs

@@ -41,4 +41,4 @@ pub fn main() {
 
     let res = climbing_stairs_dp_comp(n);
     println!("爬 {n} 阶楼梯共有 {res} 种方案");
-}
+}

codes/rust/chapter_dynamic_programming/min_cost_climbing_stairs_dp.rs

@@ -45,4 +45,4 @@ pub fn main() {
 
     let res = min_cost_climbing_stairs_dp_comp(&cost);
     println!("爬完楼梯的最低代价为 {res}");
-}
+}