mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-30 03:47:14 +00:00
zig : upgrade codes && rust : add codes for chapter_searching and chapter_dynamic_programming. (#591)
* zig : update zig codes * rust : add codes for linear_search and hashing_search * rust : add codes for linear_search and hashing_search * rust : add codes for chapter_dynamic_programming
This commit is contained in:
@@ -0,0 +1,27 @@
|
||||
/*
|
||||
* File: climbing_stairs_dfs.rs
|
||||
* Created Time: 2023-07-09
|
||||
* Author: sjinzh (sjinzh@gmail.com)
|
||||
*/
|
||||
|
||||
/* 搜索 */
|
||||
fn dfs(i: usize) -> i32 {
|
||||
// 已知 dp[1] 和 dp[2] ,返回之
|
||||
if i == 1 || i == 2 { return i as i32 };
|
||||
// dp[i] = dp[i-1] + dp[i-2]
|
||||
let count = dfs(i - 1) + dfs(i - 2);
|
||||
count
|
||||
}
|
||||
|
||||
/* 爬楼梯:搜索 */
|
||||
fn climbing_stairs_dfs(n: usize) -> i32 {
|
||||
dfs(n)
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
pub fn main() {
|
||||
let n: usize = 9;
|
||||
|
||||
let res = climbing_stairs_dfs(n);
|
||||
println!("爬 {n} 阶楼梯共有 {res} 种方案");
|
||||
}
|
||||
Reference in New Issue
Block a user