746. Min Cost Climbing Stairs[Leetcode从零开刷]

题目来源

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

---

解答：

写这个题的时候，有一种脑筋急转弯的感觉。
题目说用一组数组表示一个楼梯，怎么样才能爬完而是损耗越小？数组里的每个数都是损失值，每一步只能走一步或两部。初始可以走0或者1都行。爬完指走出数组。
java代码如下:
按照题目意思顺着数组爬，用一个数组记录每次的损失，并加上上一步的损失，爬出时则返回损失数组的最后一个即可。

class Solution {
    public int minCostClimbingStairs(int[] cost) {
        int[]cosV = new int [cost.length+1];
        cosV[0] = cost[0];
        cosV[1] = cost[1];

        for(int i = 2; i <=cost.length; i++){
            int cosD = (i==cost.length)? 0:cost[i];
            cosV[i] = Math.min(cosV[i-1] + cosD,cosV[i-2] + cosD);//核心：第三个记录的损失必须是前两者和的最小值，表示从哪一个数过来的方法。
        }
        return cosV[cost.length];
    }
}