leetcode_Climbing Stairs
来源:互联网 发布:手机兼职软件 编辑:程序博客网 时间:2024/06/14 13:39
描述:
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?
思路:
变形的斐波那契
代码:
public int climbStairs(int n) { if(n<3) return n; int arr[]=new int[n+1]; arr[1]=1; arr[2]=2; for(int i=3;i<=n;i++) arr[i]=arr[i-1]+arr[i-2]; return arr[n]; }
结果:
0 0
- leetcode_Climbing Stairs
- LeetCode_climbing-stairs
- LeetCode_Climbing Stairs--爬楼梯
- Leetcode_climbing-statirs (c++ and python version)
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- vim编码
- hadoop实现原理(一)配置信息处理
- Java程序员面试失败的5大原因
- xargs用法
- splay__poj3580
- leetcode_Climbing Stairs
- Sublime Text3重要的插件
- 汉字统计HDU 2030
- Linux设置自动启动TOMCAT
- Android开发中EditText获得焦点弹出输入框改变屏幕布局的问题
- .NET学习之010203总结
- Splay终极模板
- Android 5.x OTA Update官方文档(五、Recovery系统下分区映射)
- 原码 补码 反码及进制转换