LeetCode 070 Climbing stairs
来源:互联网 发布:手机淘宝可以比价吗 编辑:程序博客网 时间:2024/05/16 12:50
题目
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?
n步道梯子顶端。每次可以1步或2步,有多少种方式?
关键点2个:
a 是否能够看出斐波那契的关系
b 是否会用从底向上来解斐波那契
- public class Solution {
- public int climbStairs(int n) {
- if(n==0){
- return 0;
- }
- if(n==1){
- return 1;
- }
- if(n==2){
- return 2;
- }
- int[] ways = new int[n+1];
- ways[0] = 0;
- ways[1] = 1;
- ways[2] = 2;
- for(int i=3; i<=n; i++){
- ways[i] = ways[i-1] + ways[i-2];
- }
- return ways[n];
- }
- }
0 0
- LeetCode: Climbing Stairs [070]
- LeetCode 070 Climbing stairs
- LeetCode 070 Climbing Stairs
- LeetCode 070 Climbing Stairs
- leetcode 070 climbing stairs
- LeetCode 070 Climbing Stairs
- LeetCode 070 Climbing Stairs
- leetcode 070 —— Climbing Stairs
- LeetCode: Climbing Stairs
- LeetCode: Climbing Stairs
- [LeetCode]Climbing Stairs
- LeetCode Climbing Stairs
- [Leetcode] Climbing Stairs
- Leetcode: Climbing stairs
- LeetCode Climbing Stairs
- [LeetCode] Climbing Stairs
- leetcode 107: Climbing Stairs
- [LeetCode] Climbing Stairs
- Unity 3D 技巧集合
- Java三大特性
- 可是有的时候真的是太在乎,太容易受伤了。
- final关键字
- poi 导出Excel
- LeetCode 070 Climbing stairs
- Ajax理解-ajax笔记
- win7/win8.1 X64下搭建Cocos2dx-3.0的开发环境
- 从零开始—java中的多值输出问题
- HDU 1074 Doing Homework(状态压缩dp)
- Fedora14下安装GoogleEarth.bin
- hdu 1402 FFT
- HDOJ 2056 Rectangles(坐标排序、矩形面积并)
- servlet 理解 --servlet笔记