LeetCode Climbing Stairs
来源:互联网 发布:美国影子银行规模数据 编辑:程序博客网 时间:2024/06/06 18:51
原题链接在这里:https://leetcode.com/problems/climbing-stairs/
其实是Fibonacci Number, 举个例子,n = 100,假设登到99台阶有m种方法,登到98台阶有n种方法,那么从99到100都是上一步,所以还是m种方法, 从98台阶登到100都是一次登两个台阶,还是n种方法,若果在98登一个台阶,就是到了99,这种方法已经包含在最初登到99台阶的m种方法中了。
所以登到100的方法就是m+n.
AC Java:
public class Solution { public int climbStairs(int n) { /* //Method 1 if(n == 0){ return 1; } if(n == 1){ return 1; } return climbStairs(n-1) + climbStairs(n-2); */ /* //Method 2 int [] arr = new int[n+1]; arr[0] = 1; arr[1] = 1; for(int i = 2; i <= n; i++){ arr[i] = arr[i-1] + arr[i-2]; } return arr[n]; */ //Method 3 if(n == 1){ return 1; } if(n == 2){ return 2; } int first = 1; int second = 2; int res = 0; for(int i = 3; i<=n; i++){ res = first + second; first = second; second = res; } return res; }}
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
- 项目3——体验复杂度 (1)
- 7 bad habits of highly ineffective software engineers
- 第二周 项目2 程序的多文件组织
- IOS 获取APP当前的版本号
- Java Map 按key排序和按Value排序
- LeetCode Climbing Stairs
- POJ 3104 Drying-二分答案
- 第四周项目1-建立单链表
- 第二周项目三复杂度问题
- java利用当前时间,得到上一个月份
- 胜景之地
- virtualbox虚拟机系统网卡设置,既能上网,又能独立ip相互访问
- 列名"xx"无效的种种可能
- Android开源框架分类