64. Minimum Path Sum.js

/**
 * Created by Xin on 01/03/2017.
 */
/**
 * @param {number[][]} grid
 * @return {number}
 */
var minPathSum = function (grid) {
  for (let i = 0; i < grid.length; i++) {
    for (let j = 0; j < grid[i].length; j++) {
      if (i !== 0 && j !== 0) {
        grid[i][j] = grid[i][j] + Math.min(grid[i][j - 1], grid[i - 1][j]);
      } else if (i === 0 && j !== 0) {
        grid[i][j] = grid[i][j] + grid[i][j - 1];
      } else if (j === 0 && i !== 0) {
        grid[i][j] = grid[i][j] + grid[i - 1][j];
      }
    }
  }
  return grid[grid.length - 1][grid[grid.length - 1].length - 1];
};
module.exports = minPathSum;