【力扣/牛客刷题】70. 爬楼梯

class Solution {
    public int climbStairs(int n) {
        int[] date = new int[n+1];
        date[0] = 1;
        date[1] = 1;
        for(int i = 2;i <= n;i++){
            date[i] = date[i-1] + date[i-2];
        }
        return date[n];
    }
}