代码随想录训练营day32|动态规划part1

斐波那契数

力扣题目链接

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

爬楼梯

力扣题目链接

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

使用最小花费爬楼梯

力扣题目链接

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        vector<vector<int>> dp(cost.size(), vector<int>(2));
        if(cost.size() == 1)
            return cost[0];
        if(cost.size() == 2)        
            return min(cost[0], cost[1]);
        int n = cost.size();
        // dp[i][0]不经过i时， dp[i][1]经过i
        dp[1] = {cost[0], cost[1]};
        dp[2] = {cost[1], min(cost[0], cost[1]) + cost[2]};
        for(int i = 3; i < cost.size(); i++){
            // 从i-1跳两格上去
            dp[i][0] = dp[i-1][1];
            // 从i-1或i-2跳到i，再跳上去
            dp[i][1] = min(dp[i-1][0],dp[i-1][1]) + cost[i];
        }
        return min(dp[n-1][0], dp[n-1][1]);
    }
};