Min Cost Climbing Stairs

Min Cost Climbing Stairs--LeetCode

(原题链接： 点击打开链接)

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:

1. cost will have a length in the range [2, 1000].
2. Every cost[i] will be an integer in the range [0, 999].

Solution：

此题主要运用动态规划的思想。noSelected[i]表示在对第i个数进行选择时，不选择这个数的总花费。因为不选择这个数时，上一个数就必须被选择，所以它的值应该应该等于上一次选择选择了对应的数的总花费，即hasSelected[i-1]。当一个数准备被选择时，它上一个是否选择并不是很重要，所以应当选择上一步花费比较小的数，所以hasSelected[i]=min(noSelected[i-1],hasSelected[i-1])+cost[i]。

class Solution {
public:
    int minCostClimbingStairs(vector<int>& cost) {
        int length = cost.size();
        int hasSelected[length];
        int noSelected[length];
        noSelected[0] = 0;
        hasSelected[0] = cost[0];
        for(int a = 1; a < length; a++)
        {
            noSelected[a] = hasSelected[a-1];
            hasSelected[a] = min(noSelected[a-1], hasSelected[a-1]) + cost[a];
        }
        return min(noSelected[length-1], hasSelected[length-1]);
    }
};