70. 爬楼梯(Easy)
# Go 示例
func climbStairs(n int) int {
if n == 0 || n == 1{
return n
}
dp := make([]int, n + 1)
dp[0] = 1
dp[1] = 1
for i := 2; i < n + 1; i++ {
dp[i] = dp[i - 1] + dp[i - 2]
}
return dp[n]
}
1
2
3
4
5
6
7
8
9
10
11
12
2
3
4
5
6
7
8
9
10
11
12
编辑 (opens new window)
上次更新: 2022/10/25, 02:40:54