70. Climbing Stairs LeetCode
来源:互联网 发布:淘宝快递模板去掉物流 编辑:程序博客网 时间:2024/04/25 19:16
题意:有n阶梯,你每次可以爬1阶梯或者2阶梯,问你爬n阶梯有多少种爬法。
题解:DP。dp[i] 表示爬到i阶梯的方法数。那么dp[i] = dp[i - 1] + dp[i - 2].
class Solution {public: int climbStairs(int n) { map<int,int> m; m.clear(); m[1] = 1; m[2] = 2; for(int i = 3; i <= n; i++) m[i] = m[i - 1] + m[i - 2]; return m[n]; }};
0 0
- [LeetCode]70.Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- [Leetcode] 70. Climbing Stairs
- [leetcode] 70.Climbing Stairs
- [leetCode]70. Climbing Stairs
- 70. Climbing Stairs LeetCode
- [LeetCode]70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- leetcode 70. Climbing Stairs
- leetcode 70. Climbing Stairs
- LeetCode *** 70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- leetcode 70. Climbing Stairs
- [LeetCode]70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- #leetcode#70.Climbing Stairs
- Sublime Text的代码自动补全的设置
- 191. Number of 1 Bits LeetCode
- 【深入实践ucos-ii】任务管理函数
- PDE2D--用Fortran编译器的跨平台的通用性颇佳的基于有限元方法的微分方程(组)求解器
- hdoj 5620 KK's Steel 【数学】
- 70. Climbing Stairs LeetCode
- HDU 2056 Rectangles(矩形面积交)
- FZU Problem 1752 A^B mod C 快速幂乘
- hrbust 哈理工OJ 1918 M数【数位dp基础】
- mac下 静态文件css403无法显示
- 83. Remove Duplicates from Sorted List LeetCode
- Mac - How to change default system font in Mac OS X Yosemite
- Ecplise中指定tomcat里Web项目发布文件
- uvaoj-1368:DNA序列