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

题意：每次上一层或两层，n层台阶都有一个花费值，踩哪个就累计响应的花费，到求顶端最少的花费。
解法：dp[i] 表示到 i 层的最小花费，dp[i] = cost[i] + min(dp[i - 2], dp[i - 1])。

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