64. Minimum Path Sum

#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 minimizes the 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.

这道题要用到动态规划。每一步都是由上一步中最小的得到的。

var minPathSum = function(grid) {
    let m = grid.length;
    let n = grid[0].length;
    let dp = new Array(m);
    for(let i=0;i<m;i++) {
        dp[i] = new Array(n);
    }
    for(let i=0;i<m;i++) {
        for(let j=0;j<n;j++) {
            dp[i][j]=0;
        }
    }
    
    dp[0][0]=grid[0][0];
    for(let i=1;i<n;i++) {
        dp[0][i] = dp[0][i-1]+grid[0][i];
    }
    for(let i=1;i<m;i++) {
        dp[i][0] = dp[i-1][0]+grid[i][0];
    }
    for(let i=1;i<m;i++) {
        for(let j=1;j<n;j++) {
            dp[i][j] = Math.min(dp[i-1][j],dp[i][j-1])+grid[i][j];
        }
    }
    return dp[m-1][n-1];
};