题目

image.png

思路

  • 类似于斐波那契问题

    代码

    1.   public int climbStairs(int n) {
    2.       if (n <= 2) return n;
    3.       int  p1 = 1, p2 = 2;
    4.       for (int i = 3; i <= n; i++) {
    5.           int t = p1 + p2;
    6.           p1 = p2;
    7.           p2 = t;
    8.       }
    9.       return p2;
    10.   }
    爬楼梯