70. Climbing Stairs
来源:互联网 发布:淘宝购物车点不开 编辑:程序博客网 时间:2024/06/06 09:53
70. Climbing Stairs
问题:
每次上楼梯可以踏一阶梯或者两阶, 问有多少中上楼梯的方式.
思路:
分析一下, 其实是个fabonacci数列问题. 上至第n阶的时候可以是踏一阶,或者踏两阶, 即f(n) = f(n-1)+f(n-2)
code:
class Solution {public: int climbStairs(int n) { if (n <= 2) return n; int n_1 = 1; int n_2 = 2; int res; for (int i = 3; i <= n; i++) { res = n_1 + n_2; n_1 = n_2; n_2 = res; } return res; }};
阅读全文
0 0
- [LeetCode]70.Climbing Stairs
- 70.Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- [Leetcode] 70. Climbing Stairs
- [leetcode] 70.Climbing Stairs
- 70.Climbing Stairs
- 70. Climbing Stairs
- 70.Climbing Stairs
- 70. Climbing Stairs
- [leetCode]70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs LeetCode
- 70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs
- [LeetCode]70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- 70. Climbing Stairs
- javax.mail.AuthenticationFailedException
- 傅盛认知三部曲后记:到底什么是认知?
- 已有一个名为“frmadd”的组件。组件的名称必须是唯一的,而且名称必须不区分大小
- Zookeeper实例原生API--删除节点
- 自定义属性
- 70. Climbing Stairs
- Mybatis基础整理
- Converted JNDI name [java:comp/env/spring.liveBeansView.mbeanDomain] not found
- Leetcode 143. Reorder List
- 游戏编程中的人工智能 五 (Python改编)
- Thinkphp5学习(19)关联:一对多
- 一分钟了解“过去完成时”
- mysql更改端口
- java 反射