70. 爬楼梯

70. 爬楼梯

题目中n为正数，所以没有必要初始化dp数组的0号位置

class Solution {
    public int climbStairs(int n) {
        int len = n + 1;
        if (n <= 2) return n;
        int b = 1;
        int c = 2;
        if (n == 2) return c;
        for (int i = 3; i < len; i++) {
            int tmp = b + c;
            b = c;
            c = tmp;
        }
        return c;

    }
}