fix climbing_stairs_constraint_dp code

This commit is contained in:
krahets
2023-08-31 02:31:58 +08:00
parent 628d8a516b
commit a47a974a6a
11 changed files with 11 additions and 11 deletions

View File

@ -6,7 +6,7 @@
/* 带约束爬楼梯:动态规划 */
fn climbing_stairs_constraint_dp(n: usize) -> i32 {
if n == 1 || n == 2 { return n as i32 };
if n == 1 || n == 2 { return 1 };
// 初始化 dp 表,用于存储子问题的解
let mut dp = vec![vec![-1; 3]; n + 1];
// 初始状态:预设最小子问题的解