✅746. 使用最小花费爬楼梯 about like-algorithms HOT 1 OPEN

/**
 * @param {number[]} cost
 * @return {number}
 */
var minCostClimbingStairs = function(cost) {
	const len = cost.length;
	const dp = Array(len + 1);
	dp[0] = cost[0];
	dp[1] = cost[1];
	for (let i = 2; i <= len; i++) {
		if (i === len) {
			dp[i] = Math.min(dp[i - 2], dp[i - 1]);
		} else {
			dp[i] = Math.min(dp[i - 2], dp[i - 1]) + cost[i];
		}
	}

	return dp[len];
};