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].
Note:
-
costwill have a length in the range[2, 1000]. - Every
cost[i]will be an integer in the range[0, 999].
解法：使用动态规划，递推公式：dp[i] = cost[i] + Math.min(dp[i - 1], dp[i - 2]);
/*** @param {number[]} cost* @return {number}*/// var minCostClimbingStairs = function (cost) {// var a = 0, b = 0, min = 0;// for (let c in cost) {// b = a;// a = cost[c] + min;// min = Math.min(a, b);// }// return min;// };var minCostClimbingStairs = function (cost) {let dp = [];dp.length = cost.length;dp.fill(0);dp[0] = cost[0];dp[1] = cost[1];for (let i = 2; i < cost.length; i++) {dp[i] = cost[i] + Math.min(dp[i - 1], dp[i - 2]);}return Math.min(dp[cost.length - 1], dp[cost.length - 2]);};//let cost = [10, 15, 20];let cost = [1, 100, 1, 1, 1, 100, 1, 1, 100, 1];console.log(minCostClimbingStairs(cost));