70. Climbing Stairs
2017-06-11 21:34
351 查看
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; } };
相关文章推荐
- LeetCode70. Climbing Stairs
- 70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- [勇者闯LeetCode] 70. Climbing Stairs
- 70. Climbing Stairs
- LeetCode 70. Climbing Stairs
- Leetcode: 70. Climbing Stairs(Week1, Easy)
- [LeetCode]70. Climbing Stairs
- 70. Climbing Stairs
- LeetCode —— 70. Climbing Stairs
- Dynamic Programing -- Leetcode problem 70. Climbing Stairs
- [LeetCode By Python]70. Climbing Stairs
- 70. Climbing Stairs(动态规划题)
- LeetCode 70. Climbing Stairs (O(n)时间, O(1)空间实现)
- 70. Climbing Stairs
- leetcode 70. Climbing Stairs