Climbing Stairs
2015-07-12 15:57
459 查看
https://leetcode.com/problems/climbing-stairs/
class Solution { public: int climbStairs(int n) { if(n==1) return 1; else if(n==2) return 2; else if(n>2) { int* nums=new int[n+1]; nums[1]=1; nums[2]=2; for(int i=3;i<=n;i++) { nums[i]=nums[i-1]+nums[i-2]; } return nums ; } else return 0; } };
相关文章推荐
- hdu 1789 Doing Homework again(贪心)
- HDU 1532 Drainage Ditches 排水渠(最大流,入门)
- See you again(电影《速度与激情7》主题曲)
- TJU-3980Painting Tree(贪心)
- 酷融贷kurongdai来啦
- 微软官方Windows主题 英国之美2 Great Britain 高分辨率的壁纸
- 微软官方Windows主题 英国之美2 Great Britain 高分辨率的壁纸
- WIP jobs available to MRP
- macbook air 开机黑屏解决方法
- 安装rails遇到的问题
- LintCode Climbing Stairs 爬楼梯
- 【概率】Uva 10900 - So you want to be a 2n-aire?
- EF--Validation failed for one or more entities. See ‘EntityValidationErrors’解决方法
- Svnmailer部署及应用
- AIX系统维护手册二.双机配置,HACMP
- AIX系统维护手册一.系统盘镜像
- my email is nuoyaxingzhe@sina.com
- @(报错)could not find the main class, Program will exit(已解决)
- 2965 - Jurassic Remains
- AIX查看某个端口被哪个进程占用并处理