【LeetCode 746】 Min Cost Climbing Stairs

最新推荐文章于 2024-09-25 20:16:11 发布

原创最新推荐文章于 2024-09-25 20:16:11 发布 · 131 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 同时被 2 个专栏收录

295 篇文章

订阅专栏

动态规划

100 篇文章

订阅专栏

本文介绍了一种使用动态规划解决的算法问题，即找到从楼梯底部到顶部的最小成本路径。通过实例解释了如何从两个可能的起始点出发，选择成本最低的路径到达顶部。代码实现展示了动态规划的应用，通过计算到达每个步骤的最小成本，最终得到到达顶层的最低成本。

题目描述

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[i] 表示到达 i 位置需要花费的代价。

代码

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