《剑指offer》原题，典型的动态规划，最后一步可能是一步或者两步
我的AC解法：
class Solution {
public:
int climbStairs(int n) {
vector<int> f;
f.push_back(0);
f.push_back(1);
f.push_back(2);
for(int i=3;i<=n;i++)
{
int s=f[i-1]+f[i-2];
f.push_back(s);
}
return f[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/clppnftx.html
网友评论