LeetCode Climbing Stairs
来源:互联网 发布:邮政储蓄网络培训学院 编辑:程序博客网 时间:2024/06/04 19:42
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?
题意: 求上n个台阶的方法数,要么走一步,要么两步。
思路:递归超时,递推
class Solution {public: int climbStairs(int n) { if (n <= 2) return n; int f[1000]; f[1] = 1, f[2] = 2; for (int i = 3; i <= n; i++) f[i] = f[i-1] + f[i-2]; return f[n]; }};
0 0
- 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
- LeetCode | Climbing Stairs
- PHP任意文件上传漏洞
- Android入门
- 写在最前面的
- 开发问题及解决 E/AndroidRuntime(15377): Caused by: java.lang.InstantiationException: can't instantiate clas
- Python开源项目大全
- LeetCode Climbing Stairs
- 用js 过滤脚本的正则
- 解决“Dynamic Web Module 3.0 requires Java 1.6 or newer.”错误
- 将Cocos2dx 3.4 嵌入到MFC中
- 导出mysql数据表 Monxin专用(PHP代码函数)
- android 帮助文档 下载源码
- Mac 系统忘记用户登录秘密
- 人最重要的能力是什么?
- Java实现RSA算法加密和解密的效率问题(问题描述)