题目
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];
- }
- }