算法设计Week8 LeetCode Algorithms Problem #70 Climbing Stairs
来源:互联网 发布:linux 系统编程delay 编辑:程序博客网 时间:2024/06/05 09:16
题目描述:
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?
Note: Given n will be a positive integer.
题目分析:
使用动态规划算法,设climb[i]为爬上第i级台阶不同方法的总数,那么有两种方式可以爬上第i级台阶:
1. 爬上第i-1级台阶后再向上爬一级台阶;
2. 爬上第i-2级台阶后再向上爬两级台阶。
这样,就可以得到递推式:
climb[i] = climb[i - 1] + climb[i - 2].
此外,climb[1] = 1, climb[2] = 2。
具体代码如下(注意代码中climb数组下标从0开始),算法的时间复杂度为
class Solution {public: int climbStairs(int n) { int climb[n] = {0}; climb[0] = 1; for(int i = 1; i < n; i++){ if(i == 1) climb[i] = 2; else climb[i] = climb[i - 1] + climb[i - 2]; } return climb[n - 1]; }};
0 0
- 算法设计Week8 LeetCode Algorithms Problem #70 Climbing Stairs
- 算法设计Week8 LeetCode Algorithms Problem #198 House Robber
- LeetCode Algorithms #70 <Climbing Stairs>
- (算法分析Week8)Climbing Stairs[Easy]
- [LeetCode]problem 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
- leetcode[70]:Climbing Stairs
- Leetcode 70 Climbing Stairs
- Canvas实现太极图案并旋转
- CentOS release 6.6 (64bit)升级GCC到4.8.2版本
- Disconf
- C++:引用作为返回值
- 数据结构&算法
- 算法设计Week8 LeetCode Algorithms Problem #70 Climbing Stairs
- 字符串和编码
- Spring mvc 拦截器
- 大神博客集合
- React Native系列之Native Modules
- Spring 使用注解方式进行事务管理
- 算法新解(一)
- 18:买书
- 信息的表示与处理