746. Min Cost Climbing Stairs

Roaring Kitty

已于 2022-04-28 09:55:25 修改

阅读量616

点赞数 1

分类专栏： Leetcode 文章标签： array

于 2018-03-21 10:40:27 首次发布

本文链接：https://blog.csdn.net/u010665216/article/details/79636440

版权

Leetcode 专栏收录该内容

245 篇文章

订阅专栏

本文介绍了一个经典的动态规划问题——最小成本爬楼梯。给定每个阶梯的成本，目标是找到从底部到达顶部的最低成本路径，可以选择一步上一级或两级。文章详细解释了状态转移方程，并提供了实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目

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].

思路

本题是个典型的dp问题。写出对应的状态子方程即可。
$d p [i] = m i n (d p [i - 1] + c o s t [i - 1], d p [i - 2] + c o s t [i - 2]);$

代码

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