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

@@ -7,7 +7,7 @@ package chapter_dynamic_programming
/* 带约束爬楼梯:动态规划 */
func climbingStairsConstraintDP(n int) int {
if n == 1 || n == 2 {
return n
return 1
}
// 初始化 dp 表,用于存储子问题的解
dp := make([][3]int, n+1)