补第十三周Leetcode算法博客

补第十三周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 cost1, 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].
这是一个动态规划的问题，我们需要对该问题设计一个状态转移方程
设Minimum[i]是一个关于到达第i个阶梯需要花费的最小花费。
Munimum[i]= min{Minimum[i-1]+cost[i-1],Minimum[i-2]+cost[i-2]

源代码

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

运行分析

“`