leetcode-Java-70. Climbing Stairs
来源:互联网 发布:淘宝吊带碎花长裙 编辑:程序博客网 时间:2024/06/16 03:47
思路:
其实可以用f(n) = f(n-1) + f(n-2);但是递归效率不高
本题用for循环替代递归
public class Solution { public int climbStairs(int n) { int[] count = new int[n+1]; if(n==1) return 1; if(n==2) return 2; count[0]=0; count[1]=1; count[2]=2; for(int i=3;i<=n;++i) count[i]=count[i-1]+count[i-2]; return count[n]; }}
0 0
- Leetcode:70. Climbing Stairs(JAVA)
- leetcode-Java-70. Climbing Stairs
- (Java)LeetCode-70. Climbing Stairs
- [LeetCode] 70. Climbing Stairs java
- [leetcode]70. Climbing Stairs(Java)
- LeetCode-70. Climbing Stairs (Java)
- [Leetcode] Climbing Stairs (Java)
- 【Leetcode】Climbing Stairs JAVA
- [LeetCode][Java] Climbing Stairs
- leetcode:Climbing Stairs 【Java】
- LeetCode Climbing Stairs JAVA
- [LeetCode]Climbing Stairs(Java)
- [LeetCode]70.Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- [Leetcode] 70. Climbing Stairs
- [leetcode] 70.Climbing Stairs
- [leetCode]70. Climbing Stairs
- 70. Climbing Stairs LeetCode
- jQuery EasyUI时间戳自定义时间显示格式类型
- C++11多线程之条件变量
- 安装VMware,创建ubuntu linux虚拟机,使用Secure连接虚拟机
- 通过Callable实现多线程
- xml要加第三方库GDataXMLDocument
- leetcode-Java-70. Climbing Stairs
- python—threading.Lock和RLock【threading模块介绍02】
- Skew Heaps 习题解
- c++第七次实验复习
- 单例对象创建
- java.util.BitSet使用与分析
- NSFileHandle
- 算法与数据结构 - 动态规划
- NSFileManger