70.爬楼梯

70. 爬楼梯

   public int climbStairs(int n) {
        int p = 1, q = 1, r = 1;
        for (int i = 2; i <= n; ++i) &#123;
            p = q;
            q = r;
            r = p + q;
        &#125;
        return r;
    &#125;

public int climbStairs(int n) {
        int[] dp = new int[n + 1];
        dp[0] = 1;
        dp[1] = 1;
        for(int i = 2; i <= n; i++) &#123;
            dp[i] = dp[i - 1] + dp[i - 2];
        &#125;
        return dp[n];
    &#125;

作者：guanpengchn
链接：https://leetcode-cn.com/problems/climbing-stairs/solution/hua-jie-suan-fa-70-pa-lou-ti-by-guanpengchn/