Minimum Path Sum LeetCode solution in JavaScript

1
var minPathSum = function (grid) {
2
  let row = grid.length;
3
  let col = grid[0].length;
4

5
  for (let i = 1; i < row; i++) {
6
    grid[i][0] += grid[i - 1][0];
7
  }
8
  for (let j = 1; j < col; j++) {
9
    grid[0][j] += grid[0][j - 1];
10
  }
11
  for (let i = 1; i < row; i++) {
12
    for (let j = 1; j < col; j++) {
13
      grid[i][j] += Math.min(grid[i - 1][j], grid[i][j - 1]);
14
    }
15
  }
16
  return grid[row - 1][col - 1];
17
};