leetcode [Climbing Stairs]
来源:互联网 发布:matlab 2015b mac下载 编辑:程序博客网 时间:2024/06/05 10:42
public int climbStairs(int n) { /*if(n == 1) return 1; if(n == 2) return 2; return climbStairs(n - 1) + climbStairs(n - 2);*/ //用递归会超时,而且效率低 ArrayList<Integer> list = new ArrayList<Integer>(); list.add(1); list.add(2); int temp = 0; for(int i = 2; i < n; i++){ temp = list.get(i - 1) + list.get(i - 2); list.add(temp); } return list.get(n - 1); }
用数组也可以实现,数组长度一共是n,可以确定的:
public class Solution { public int climbStairs(int n) { /*if(n == 1) return 1; if(n == 2) return 2; return climbStairs(n - 1) + climbStairs(n - 2);*/ //用递归会超时,而且效率低 if(n == 1 || n == 2) return n;//这里先处理了否则后面会有下标越界 int[] res = new int[n]; res[0] = 1; res[1] = 2; for(int i = 2; i < n; i++) res[i] = res[i - 1] + res[i - 2]; return res[n - 1]; }}
0 0
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- [LeetCode]Climbing Stairs
- [leetcode]Climbing Stairs
- LeetCode-Climbing Stairs
- [leetcode] Climbing Stairs
- LeetCode - Climbing Stairs
- LeetCode:Climbing Stairs
- Leetcode Climbing Stairs
- LeetCode | Climbing Stairs
- 关于监听套接字的形象解释
- String、StringBuffer、StringBuilder的区别
- dll 导出函数
- C语言对文件操作01
- jquery事件与绑定事件
- leetcode [Climbing Stairs]
- servlet详解(第一篇)
- host 域名解析
- Unity说明文档翻译-The Main Windows
- 一遍记住Java常用的八种排序算法与代码实现
- webpack使用(三)
- BZOJ2286: [Sdoi2011]消耗战 虚树
- Android WiFi源码分析
- Java配置----JDK开发环境搭建及环境变量配置