LeetCode OJ平台上的Climbing Stairs题目用java迭代解决
来源:互联网 发布:校园网络安全教育 编辑:程序博客网 时间:2024/06/05 08:08
题目如下。
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?
谢谢木易先森的点拨,f(n)表示爬n个台阶的方法数,f(n) = f(n-1) + f(n-2);
f(1) = 1;
f(2) =2;
以此迭代即可。
public class Solution { public int climbStairs(int n) { int s1 = 1; int s2 = 2; int result = 0; if(n < 1) return 0; else if(n < 2) return 1; else if(n < 3) return 2; else{ for(int i = 0; i < n - 2; i ++){ result = s1 + s2; s1 = s2; s2 = result; } } return result; }}
0 0
- LeetCode OJ平台上的Climbing Stairs题目用java迭代解决
- LeetCode OJ:Climbing Stairs
- LeetCode OJ - Climbing Stairs
- [LeetCode OJ]Climbing Stairs
- LeetCode OJ Climbing Stairs
- <LeetCode OJ> 70. Climbing Stairs
- [leetcode oj 70]Climbing Stairs
- [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 题目+解析+JAVA代码
- Leetcode OJ平台上的Binary Tree Preorder Traversal题目用java ArrayDeque实现
- LeetCode OJ平台上Single Number II题目使用java位运算解决
- Leetcode:70. Climbing Stairs(JAVA)
- leetcode-Java-70. Climbing Stairs
- java程序设计的基本原则
- 多功能筛选
- POJ 1392 Ouroboros Snake(数位欧拉:输出路径)
- jQuery的attr与prop
- jquery实现iframe自适应高度
- LeetCode OJ平台上的Climbing Stairs题目用java迭代解决
- android 后台长时间执行周期性定时任务 解决方案收集
- 股市二十年记忆【一】
- Java之BigInteger
- 关于NIO 非阻塞io应用
- java 起名规范
- oracle 10g 预安装脚本
- 内连接和外连接的区别
- 贾樟柯 《天注定》 观后感