Climbing Stairs
来源:互联网 发布:晃然学姐的淘宝店 编辑:程序博客网 时间:2024/06/15 07:34
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?
这是一个简单的Fibonaci问题,只是前三个元素应为0,1,2.
public int climbStairs(int n) {if(n<=2)return n;long one=1,two=2,now=0;for(int i=3;i<=n;i++){now=one+two;one=two;two=now;}return (int) now;}
0 0
- 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
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- Climbing Stairs
- objectARX错误处理函数
- 什么是流媒体技术
- C语言分支结构语句if-else语句
- 学习笔记:linuxc第七章—进程控制 下篇
- VC 修改窗口属性
- Climbing Stairs
- 初始EhCache(超轻量级缓存技术)
- 跟着视频学Photoshop CC商业广告案例设计——互动出版网
- vector的一些操作
- H264 -3 NALU详解
- C# WinForm开发系列 - 文章索引
- postgre sql 类型转换
- POJ 2955 Brackets
- SpringMVC +Hibernate JPA+Spring-data-jpa