题解 | #最小花费爬楼梯#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param cost int整型一维数组
     * @return int整型
     */
    public int minCostClimbingStairs (int[] cost) {
        // write code here
        int minResult[] = new int[cost.length];
        minResult[0] = cost[0];
        if(cost.length == 1)
            return 0;
        minResult[1] = cost[1];

        for (int i = 2; i < cost.length; i++) {
            if(minResult[i - 1] + cost[i] < minResult[i - 2] +cost[i]){
                minResult[i] = minResult[i - 1] + cost[i];
            }else {
                minResult[i] = minResult[i - 2] + cost[i];
            }
        }
    
       return minResult[cost.length - 2] < minResult[cost.length - 1] ? 
        minResult[cost.length - 2]: minResult[cost.length - 1];
    }
}