70. 爬楼梯（动态规划/c++）

动态规划

class Solution {
public:
    int climbStairs(int n) {
        if(n <= 1)return 1;
        vector<int>dp(n+1);
        dp[1] = 1;
        dp[2] = 2;
        for(int i = 3;i <= n;i++){
            dp[i] = dp[i-1]+dp[i-2];
        }
        return dp[n];
    } 
};

转化为斐波那契数

节约空间复杂度

class Solution {
public:
    int climbStairs(int n) {
        if(n <= 2)return n;
        int a = 1;
        int b = 2;
        int sum = 0;
        for(int i = 3;i <= n;i++){
            sum = a + b;
            a = b;
            b = sum;
        }
        return sum;
    }
};