hello-algo/en/codes/rust/chapter_dynamic_programming/climbing_stairs_dfs.rs

30 lines
591 B
Rust

/*
* File: climbing_stairs_dfs.rs
* Created Time: 2023-07-09
* Author: codingonion (coderonion@gmail.com)
*/
/* Search */
fn dfs(i: usize) -> i32 {
// Known dp[1] and dp[2], return them
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
}
/* Climbing stairs: Search */
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!("Climb {n} steps, there are {res} solutions in total");
}