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

题目大意：
每一级台阶i对应一个价值cost[i],每次可以上一级台阶或者两级台阶，求上完所有台阶花费的最小价值。

题目思路:
简单动态规划题目，声明一个dp数组存放到达每一级台阶的最小花费，状态转移式为dp[i] = min(dp[i-1], dp[i-2])+cost[i].注意上完所有台阶是最后到cost.size()的位置(下标从0开始)，故dp的数组长度为cost.size()+1。dp[cost.size()]的值即为所求。

完整代码：

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

这是我dp问题第一次1AC啊，虽然难度是easy，还是很开心啊。dp之路依然漫长啊，还需努力。