题目链接

class Solution {
    public int minCostClimbingStairs(int[] cost) {
        int len = cost.length;
        int[] dp = new int[len+1];
        for(int i=2;i<len;i++){
            dp[i]=Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
        }
        dp[len]=Math.min(dp[len-1]+cost[len-1],dp[len-2]+cost[len-2]);
        return dp[len];
    }
}