题目
思路：dp[i] = dp[i - 1 ] + dp[i - 2];
public int climbStairs(int n) {
if (n == 1) {
return 1;
}
int[] dp = new int[n + 1];
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1 ] + dp[i - 2];
}
return dp[n];
}
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 ...
题目分析 You are climbing a stair case. It takes n steps to r...
本文标题：70. Climbing Stairs
本文链接：https://www.haomeiwen.com/subject/mbodyqtx.html
网友评论