Climbing Stairs
来源:互联网 发布:隐形眼镜掉在地上 知乎 编辑:程序博客网 时间:2024/06/13 23:32
这题是个斐波那契数列,规律很好找,不过dfs这题也可以解,就是不知道会不会TLE
class Solution {public: int a[1000]; int climbStairs(int n) { a[0] = 1; a[1] = 1; for( int i = 2; i <= 1000; i++ ) a[i] = a[i-1]+a[i-2]; return a[n]; }};
0 0
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Java应用程序编程
- shell脚本之从用户读取输入并进行验证
- SqlServer还原数据库时,提示无法获得对数据库的独占访问权 的错误解决方法
- Java 多态
- Joomla微博推广
- Climbing Stairs
- iPhone 5即将基于NFC的苹果产品
- IPraxa不断升级你的职业生涯有实际的培训
- UVA 10596 - Morning Walk
- iPad的必备技巧
- jquery点击空白处隐藏div
- 常用设计模式的应用场景
- [置顶] 中文翻译 for S5PV210_iROM
- iOS必备小技巧(非常的全)