leetcode No70. Climbing Stairs
来源:互联网 发布:中国自然灾害数据库 编辑:程序博客网 时间:2024/06/03 19:52
Question:
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?
爬楼梯,一次只能爬1阶或者2阶,问总共有多少种结果。
Algorithm:
Dynamic Programming动态规划,s[i]=s[i-1]+s[i-2]
Accepted Code:
class Solution {public: int climbStairs(int n) { if(n==0)return 0; else if(n==1)return 1; else if(n==2)return 2; vector<int> res(n,0); res[0]=1; res[1]=2; for(int i=2;i<n;i++) res[i]=res[i-1]+res[i-2]; return res[n-1]; }};
0 0
- leetcode No70. Climbing Stairs
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- [LeetCode]Climbing Stairs
- [leetcode]Climbing Stairs
- LeetCode-Climbing Stairs
- [leetcode] Climbing Stairs
- LeetCode - Climbing Stairs
- LeetCode:Climbing Stairs
- Leetcode Climbing Stairs
- redis主从复制
- hdfs常用命令
- 从关系型数据库到非关系型数据库
- 关于自增和自减
- css overflow ; clear:both ; 文本行数
- leetcode No70. Climbing Stairs
- 杭电-2072
- Uva11021 tribbles 概率dp
- Android常用开源工具(1)-Dagger2入门
- POJ3276-Face The Right Way
- Android 图片Bitmap的剪切
- JavaEE程序猿之容器的世界-变量 ⑨
- 给Java项目增加验证码支持
- POJ2395Out of Hay[Check set]