64. Minimum Path Sum

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizesthe sum of all numbers along its path.

Note: You can only move either down or right at any point in time.

Example:

Input:
[
  [1,3,1],
  [1,5,1],
  [4,2,1]
]
Output: 7
Explanation: Because the path 1→3→1→1→1 minimizes the sum.

题解：这道题我一开始用的是深搜，但是TLE了，优化之后还是超时，我就意识到要换种解法了

我们按题意一步一步走，每到一个位置就求出从起点到这个位置的最小距离

根据公式 min(h, l) = val(h, l) + min(val(h - 1, l), val(h, l -1)), 起先还要对第一行和第一列进行预处理，具体的操作看代码

/**
 * @param {number[][]} grid
 * @return {number}
 */
var minPathSum = function(grid) {
    let h = grid.length
    let l = grid[0].length
    for(let i = 0; i < h - 1; i ++) {
        grid[i + 1][0] += grid[i][0] 
    }
    for(let i = 0; i < l - 1; i ++) {
        grid[0][i + 1] += grid[0][i]
    }
    for(let i = 1; i < h; i ++) {
        for(let j = 1; j < l; j ++) {
            grid[i][j] += Math.min(grid[i][j - 1], grid[i - 1][j])
        }
    }
    return grid[h - 1][l - 1]
};