Day33 动态规划

动态规划解题步骤：

1. 确定dp数组及下标的含义

2. 确定递推公式

3. dp数组初始化

4. 确定遍历顺序

5. 举例推导dp数组

509. 斐波那契数

class Solution {
public:
    int fib(int n) {
        if(n <= 1) return n;

        vector<int> dp(n + 1);

        dp[0] = 0;
        dp[1] = 1;
        for (int i = 2; i < dp.size(); ++i) {
            dp[i] = dp[i-1] + dp[i-2];
        }

        return dp[n];
    }
};

70. 爬楼梯

class Solution {
public:
    int climbStairs(int n) {
        if (n <= 2) return n;

        vector<int> dp(n);

        dp[0] = 1;
        dp[1] = 2;
        for (int i = 2; i < n; ++i) {
            dp[i] = dp[i - 1] + dp[i - 2];
        }
        return dp[n-1];
    }
};

746. 使用最小花费爬楼梯

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        vector<int> dp(cost.size() + 1);

        dp[0] = 0;
        dp[1] = 0;

        for (int i = 2; i < cost.size() + 1; i++) {
            dp[i] = min(dp[i - 1] + cost[i - 1], dp[i -2] + cost[i - 2]);
        }

        return dp.back();
    }
};