Climbing Stairs
2014-04-13 15:37
309 查看
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
class Solution {
public:
int climbStairs(int n)
{
vector<int> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++)
dp[i] = dp[i - 1] + dp[i - 2];
return dp
;
}
};可以得到递推公式，经过每一步梯子时的方法为T
= T[n-1] + T[n-2]
第一次用递归超时
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
class Solution {
public:
int climbStairs(int n)
{
vector<int> dp(n + 1, 0);
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++)
dp[i] = dp[i - 1] + dp[i - 2];
return dp
;
}
};可以得到递推公式，经过每一步梯子时的方法为T
= T[n-1] + T[n-2]
第一次用递归超时
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode: Climbing Stairs
- Leetcode: Climbing Stairs
- LeetCode-Climbing Stairs
- [second]Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- LeetCode 70 — Climbing Stairs（C++ Java Python）
- [LeetCode] Climbing Stairs
- leetcode - Climbing Stairs
- leetcode: Climbing Stairs
- 【矩阵加速_矩阵乘法_位运算】Climbing Stairs 求费波拉契数
- Climbing Stairs
- Merge Sorted Array,Merge Two Sorted Lists,Remove ... Sorted List,Count and Say,Climbing Stairs
- Climbing Stairs - LeetCode
- Climbing Stairs
- [LeetCode]70 Climbing Stairs
- Climbing Stairs
- [LeetCode] Climbing Stairs
- Climbing Stairs 递推上台阶
- 【leetcode】Climbing Stairs