mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 03:36:28 +08:00
b1f8857212
* rust : add codes for chapter_dynamic_programming * zig : add codes for chapter_dynamic_programming * rust : add codes for chapter_backtracking * Update n_queens.rs --------- Co-authored-by: Yudong Jin <krahets@163.com>
27 lines
No EOL
580 B
Rust
27 lines
No EOL
580 B
Rust
/*
|
|
* 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} 种方案");
|
|
} |