leetcode-70.爬楼梯

原始思路

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
    public int climbStairs(int n) {
        if (n == 0 || n == 1){
            return n;
        }
        // 定义初始状态
        int[] mem = new int[n+1];
        mem[1] = 1;
        mem[2] = 2;
        for (int i = 3; i<= n; i++){
            mem[i] = mem[i-1] + mem[i-2];
        }
        return mem[n];
    }
}