动态规划的思路
当前步骤的结果，等于前两步的结果相加
func climbStairs(n int) int {
if n < 2 {
return 1
}
tmp := []int{1, 2}
for i := 2; i < n; i++ {
tmp = append(tmp, tmp[i-1]+tmp[i-2])
}
return tmp[n-1]
}
动态规划的思路
当前步骤的结果，等于前两步的结果相加
func climbStairs(n int) int {
if n < 2 {
return 1
}
tmp := []int{1, 2}
for i := 2; i < n; i++ {
tmp = append(tmp, tmp[i-1]+tmp[i-2])
}
return tmp[n-1]
}
动态规划的思路当前步骤的结果，等于前两步的结果相加
70. Climbing Stairs Description You are climbing a stair ...
70. Climbing Stairs You are climbing a stair case. It tak...
例1：LeetCode 第 70 题：Climbing Stairs 传送门：英文网址：70. Climbing ...
70. Climbing Stairs : Easy198. House Robber : Easy121. ...
分类：String 时间复杂度: O(n) 70. Climbing Stairs Given an array ...
70. 爬楼梯[https://leetcode-cn.com/problems/climbing-stairs/...
70. 爬楼梯[https://leetcode.cn/problems/climbing-stairs/] 假设...
分类：Backtracking/DP 时间复杂度: O(n*m) 70. Climbing Stairs You ...
问题链接 70. 爬楼梯[https://leetcode-cn.com/problems/climbing-st...
本文标题：70. Climbing Stairs.go
本文链接：https://www.haomeiwen.com/subject/nxcsvqtx.html
网友评论