minCostClimbingStairs.js

minCostClimbingStairs.js

// https://leetcode.com/problems/min-cost-climbing-stairs/description/

function minCostClimbingStairs(cost) {
  const N = cost.length;
  let [first, second] = cost; 
  
  for (let i = 2; i <= N; i++) {
    [first, second] = [
      second,
      (cost[i] ?? 0) + Math.min(second, first),
    ];
  }

  return second;
}