Climbing Stairs
来源:互联网 发布:java开发者 编辑:程序博客网 时间:2024/05/21 04:00
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?
class Solution {public: int climbStairs(int n) {if(n <= 0)return 0;int *step = new int[n + 1];step[0] = 1;step[1] = 1;for(int i = 2; i <= n; i++){step[i] = step[i - 1] + step[i - 2];}return step[n]; }};
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
- mybatis一些简单的基本用法
- Java 内存区域和GC机制
- linux下安装XAMPP
- 数值分析学习(二)之Open Methods求根
- 基于jQuery的AJAX和JSON的实例
- Climbing Stairs
- Struts2(XWork)中的Container 一
- log4j学习
- 关于ie的兼容性trim
- Leetcode: Factorial Trailing Zeroes
- 根据文件路径检测文件大小并检测是否正在被占用
- vector中erase用法注意事项
- android 颜色值
- 读取FAT16文件