70. Climbing Stairs
来源:互联网 发布:104cm肛塞淘宝 编辑:程序博客网 时间:2024/04/25 10:03
动态规划 最后一步走1步还是两步
public class Solution {
public int climbStairs(int n) {
if(n==1){
return 1;
}
if(n==2){
return 2;
}
int lastlast=1;
int last=2;
int now=0;
for(int i=3;i<=n;i++){
now=last+lastlast;
lastlast=last;
last=now;
}
return now;
}
}
0 0
- [LeetCode]70.Climbing Stairs
- 70.Climbing Stairs
- LeetCode --- 70. Climbing Stairs
- [Leetcode] 70. Climbing Stairs
- [leetcode] 70.Climbing Stairs
- 70.Climbing Stairs
- 70. Climbing Stairs
- 70.Climbing Stairs
- 70. Climbing Stairs
- [leetCode]70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs LeetCode
- 70. Climbing Stairs
- 70. Climbing Stairs
- 70. Climbing Stairs
- [LeetCode]70. Climbing Stairs
- 【LeetCode】70. Climbing Stairs
- 70. Climbing Stairs
- Python模块之SciPy
- Java常用的数组排序
- java学习笔记之枚举类enum(转载)
- jsp/servlet/struts/hibernate/spring内部实现机制
- Fliptile POJ 3279(开关问题)
- 70. Climbing Stairs
- 83. Remove Duplicates from Sorted List
- Linux平台sdp discovery编程
- 263. Ugly Number
- C语言,设计出租车计价器,不能计算夜间加费用的版本
- 算法之美_源代码发布(9)
- 202. Happy Number
- shfit+alt+s用于eclipse
- c++多线程编程