share my java solution!


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

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.