[LeetCode]70. Climbing Stairs
来源:互联网 发布:微信站街营销软件 编辑:程序博客网 时间:2024/03/28 16:39
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?
思路:动态规划,每增加一级台阶,最后一步有两种走法,一个台阶or两个台阶
递推公式为 store[i] = store[i-1] + store[i-2];
代码如下:
public int climbStairs(int n) { if(n < 0) return 0; if(n == 1) return 1; int[] store = new int[n]; store[0] = 1; store[1] = 2; for(int i = 2; i < n; ++i) store[i] = store[i-1] + store[i-2]; return store[n-1]; }
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
- Android NDK开发“Hello World NDK”
- AlphaGo对战李世石谁能赢?两万字长文深挖围棋AI技术(二)
- 项目记录27--unity-tolua框架 网络端+protobuf
- 输出单向链表中倒数第k个结点
- AlphaGo对战李世石谁能赢?两万字长文深挖围棋AI技术(一)
- [LeetCode]70. Climbing Stairs
- INFORMIX 11.7 软件安装配置详细解释
- 2016.03.08
- LRU缓存实现(Java)
- regex_search()和getline(cin,str)函数,以及对其中正则表达式的解释
- 使用AccessibilityService实现微信自动抢红包
- mockito mock测试框架
- wiki-confluence乱码问题
- 查看端口占用