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

console.log(minCostClimbingStairs([10, 15, 20]));
console.log(minCostClimbingStairs([1, 100, 1, 1, 1, 100, 1, 1, 100, 1]));

/**
 * @param {number[][]} grid
 * @return {number}
 */
var minPathSum = function (grid) {
  const m = grid.length;
  const n = grid[0].length;

  for (let i = 0; i < m; i++) {
    for (let j = 0; j < n; j++) {
      if (i === 0) {
        if (j === 0) continue;
        else grid[i][j] += grid[i][j - 1];
      } else if (j === 0) grid[i][j] += grid[i - 1][j];
      else {
        grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
      }
    }
  }
  return grid[m - 1][n - 1];
};

console.log(
  minPathSum([
    [1, 3, 1],
    [1, 5, 1],
    [4, 2, 1],
  ])
);