动态规划之最少爬梯耗费

最新推荐文章于 2022-05-11 03:33:05 发布

dream161110

最新推荐文章于 2022-05-11 03:33:05 发布

阅读量288

点赞数

分类专栏： LeetCode 文章标签：动态规划

本文链接：https://blog.csdn.net/dream161110/article/details/79053289

版权

LeetCode 专栏收录该内容

31 篇文章 0 订阅

订阅专栏

LeetCode 746. Min Cost Climbing Stairs

题目

On a staircase, the i-th step has some non-negative cost cost[i] assigned (0 indexed).

Once you pay the cost, you can either climb one or two steps. You need to find minimum cost to reach the top of the floor, and you can either start from the step with index 0, or the step with index 1.

Example 1:

Input: cost = [10, 15, 20]
Output: 15
Explanation: Cheapest is start on cost[1], pay that cost and go to the top.

Example 2:

Input: cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1]
Output: 6
Explanation: Cheapest is start on cost[0], and only step on 1s, skipping cost[3].

Note:

cost will have a length in the range [2, 1000].
Every cost[i] will be an integer in the range [0, 999].

分析

这道题的意思很简单，就是在数组中每相邻两个数至少选一个，使得加起来的总和最少。使用动态规划问题，从左到右，记录到达每个数的总和。

代码

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int n = cost.size();
        if (n == 0) return 0;
        if (n == 1) return cost[0];
        int* dp = new int[n+1];
        dp[0] = 0;
        dp[1] = 0;
        for (int i = 2; i <= n; i++) {
            dp[i] = (dp[i-2] + cost[i-2]) < (dp[i-1] + cost[i-1]) ? (dp[i-2] + cost[i-2]) : (dp[i-1] + cost[i-1]);
        }
        int res = dp[n];
        delete []dp;
        return res;
    }
};