【LeetCode】70. Climbing Stairs
来源:互联网 发布:生成对抗网络最新 编辑:程序博客网 时间:2024/04/28 10:47
Problem here
Problem
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?
Solution
這題之前做過
就是超級樓梯那條
class Solution {public: int climbStairs(int n) { vector<int> f; f.push_back(1); f.push_back(1); for(int i = 2; i <= n; i++){ f.push_back(f[i-1] + f[i-2]); } return f[n]; }};
0 0
- [LeetCode]70.Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- [Leetcode] 70. Climbing Stairs
- [leetcode] 70.Climbing Stairs
- [leetCode]70. Climbing Stairs
- 70. Climbing Stairs LeetCode
- [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
- hadoop平台搭建(4)--伪分布式的配置及运行
- 上周工作中遇到的问题以及解决方法总结
- Android-->圆角图片,圆角任意View,圆角父布局Layout(任意形状的View且超简洁实现)
- android:Widget.Material.Button.Colored找不到
- 顺时针打印矩阵
- 【LeetCode】70. Climbing Stairs
- 欢迎使用CSDN-markdown编辑器
- Linux进程调度时机和进程切换
- 为什么要使用Iocomp控件?
- forward指令乱码问题
- android 6.0运行时权限的申请(微信在android 6.0上实现运行时请求权限的实现)
- 类的设计技巧
- Redis 3 所有命令
- ubuntu虚拟内存使用的配置