Climbing Stairs
来源:互联网 发布:下载机械制图软件 编辑:程序博客网 时间:2024/06/08 12:09
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?
DP最简单的题目
class Solution {public: int climbStairs(int n) {if(n<=2) return n;vector<int> climb(n);climb[0] = 1;climb[1] = 2;for(int i=2;i<n;++i){climb[i] = climb[i-1]+climb[i-2];}return climb[n-1]; }};
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
- 设计模式C++实现(11)——装饰模式
- 《c程序设计语言》读书笔记-5.3-指针实现strcat
- js中对象创建方式及其优势和不足1
- 内存DC也有视口和窗口的
- I007-黑马程序员_毕向东_Java基础视频教程第01天-07-Hello World
- Climbing Stairs
- Portal技术介绍
- android学习笔记-应用程序结构
- 百度坐标拾取
- 【Andord实战】SlideMenu+ViewPagerIndictor滑动侧边双栏+滑动导航栏
- uva-101 && poj 1208 The Blocks Problem (模拟栈)
- BZOJ 3744 Gty的妹子序列 分块+树状数组+可持久化线段树
- js对象创建的方式及其优势和不足2
- 欢迎您在新浪博客安家