image.png
class Solution {
public:
int climbStairs(int n) {
vector<int> dp(n+1);
dp[0] = 1;
dp[1] = 1;
for(int i = 2; i < n+1; i++){
int a = (i - 1 >= 0) ? dp[i - 1] : 0;
int b = (i - 2 >= 0) ? dp[i - 2] : 0;
dp[i] = a + b;
}
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/gdkowftx.html
网友评论