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

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param cost int整型一维数组 
     * @return int整型
     */
    public int minCostClimbingStairs (int[] cost) {
        // write code here
        int n = cost.length;
        if(n <= 1){
            return 0;
        }
        int a = 0;
        int b = 0;
        int min = 0;
        for(int i = 2; i <= n; i++){
            min = Math.min(a + cost[i - 2], b + cost[i - 1]);
            a = b; 
            b = min;
        }
        return min;
    }
}