70. Climbing Stairs

• Total Accepted: 170597
• Total Submissions: 432155
• Difficulty: Easy
• Contributor: LeetCode

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?

Note: Given n will be a positive integer.

一个n阶的楼梯，从n阶走到0阶有几种走法？

本题使用动态规划解决，第n阶的走法=第n-1阶的走法+第n-2阶的走法

public class Solution {
    int temp[] = new int[100];
    public int climbStairs(int n) {
        if(n<=1) return 1;
        if(temp[n] != 0) return temp[n];
        return temp[n] = climbStairs(n-1) + climbStairs(n-2);
    }
}