最小路径和

最小路径和

题目 找出从左上角到右下角的路，使得路径上的数字总和最小。

思路： 本题是典型的动态规划问题。递推公式如下：
$$grid(i,j)=grid(i,j)+min(grid(i+1,j),grid(i,j+1))$$
代码

右下角

public class Solution{
    public int minPathSum(int[][] grid){
        for(int i = grid.length - 1;i >= 0; i--){
            for(int j = grid[0].length - 1; j >= 0;j++){
                if(i == grid.length - 1 && j!= grid[0].length - 1){
                    grid[i][j] = grid[i][j] + grid[i][j+1];
                }else if (j == grid[0].length - 1 && i != grid.length - 1){
                    grid[i][j] = grid[i][j] + grid[i + 1][j];
                }else if(j != grid[0].length - 1 && i != grid.length - 1){
                    grid[i][j] = grid[i][j] + Math.min(grid[i+1][j],grid[i][j+1]);
                }
            }
        }
        return gird[0][0];
    }
}

左上角

public class Solution{
    public int minPathSum(int[][] grid){
        int R = grid.length;
        int C = grid[0].length;
        for(int i=0;i<R;i++){
            for(int j=0;j<C;j++){
                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];
                }else if(j!=0 && i!=0){
                    grid[i][j] = grid[i][j] + Math.min(grid[i-1][j],grid[i][j-1]);
                }
            }
        }
        return grid[R-1][C-1];
    }
}