Leetcode动态规划专题：第二天

爬梯子

这道题其实就是斐波那锲数列的变形

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

使用最小花费爬楼梯

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int a = 0, b = 0, n = cost.size();
        int c = min(cost[0], cost[1]);
        for (int i = 2; i <= n; i ++ )
        {
            c = min(a + cost[i - 2], b + cost[i - 1]);
            a = b;
            b = c;
        }
        return c;
    }
};