Leetcode题解 70. Climbing Stairs
来源:互联网 发布:mac jmeter下载安装 编辑:程序博客网 时间:2024/05/01 11:46
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?
建表,查表法搞定,用递归会做重复工作,效率不高。
public static int climbStairs(int n) { int[] result = new int[1000]; result[0] = 0; result[1] = 1; result[2] = 2; for (int i = 3; i < result.length; i++) { result[i] = result[i - 1] + result[i - 2]; } return result[n]; }
0 0
- Leetcode题解 70. Climbing Stairs
- leetcode题解-70. Climbing Stairs
- LeetCode题解:Climbing Stairs
- LeetCode题解:Climbing Stairs
- LeetCode题解:Climbing Stairs
- LeetCode 题解(226) : 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
- 70. Climbing Stairs LeetCode
- [LeetCode]70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- leetcode 70. Climbing Stairs
- leetcode 70. Climbing Stairs
- LeetCode *** 70. Climbing Stairs
- 关于Node.js你必须要知道的原理性知识
- Flume:本地文件到HDFS
- Cordova(Phonegap)在iOS端App的使用(二)---插件的创建
- librbd代码目录解读
- python 类属性
- Leetcode题解 70. Climbing Stairs
- Android Studio 错误 Duplicate files copied in APK META-INF/LICENSE.txt
- 【Leetcode】1.Two Sum 解题
- 【码上杂谈】关于之前对Server上允许的最大TCP连接数理解错误的更正
- poj 2082 Terrible Sets
- 背包问题
- ZOJ-3802-Easy 2048 Again【状态压缩dp】【位运算】【好题】
- compoer安装
- 杭电2187