【70】Climbing Stairs
来源:互联网 发布:索信达数据 编辑:程序博客网 时间:2024/05/17 22:52
问题:
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.
思路:
其实是一个斐波那契数列:
当n=1时只有一种情况;
当n=2时有两种情况;
当n>2时长度为N可以看做n-1又爬了长为1的一步或者n-2爬了长为2的一步,并且这两种情况不会有重合,所以这两种情况之和即为所求;
代码:
class Solution {public: int climbStairs(int n) { int res; if (n<=0) res=0; if (n==1) res=1; if (n==2) res=2; else { int r1=1; int r2=2; for(int i=2;i<n;i++) { res=r1+r2; r1=r2; r2=res; } } return res; }};
0 0
- [70]Climbing Stairs
- LeetCode(70)Climbing Stairs
- leetcode 70-Climbing Stairs
- [leetcode 70] Climbing Stairs
- 70、Climbing Stairs
- leetcode || 70、 Climbing Stairs
- [leetcode] #70 Climbing Stairs
- LeetCode 70 Climbing Stairs
- leetcode 70 Climbing Stairs
- 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
- label的用法
- HZAU 1209 Deadline (技巧)
- learning python in the hard way习题6~10的附加题练习
- java操作图片生成水印
- jdk源码解读-并发包-Lock-ReentrantLock(1)--lock()与unlock()方法走读
- 【70】Climbing Stairs
- 信号---信号的阻塞
- 四、用servlet类返回WEB-INF中的页面
- 像“钢铁侠”埃隆·马斯克那样,成为超速学习者
- 变量、作用域和内存问题
- Redhat7.0下搭建邮件服务器(二)
- 把排序数组转换为高度最小的二叉搜索树
- MAC OS 运行hadoop提示util.NativeCodeLoader: Unable to load native-hadoop library for your platform的解决
- 二叉树的路径和