Minimum Path Sum

DP问题

设置数组dp[i][j]表示到达grid[i][j]的最短路径，

那么dp[i][j] = min{dp[i-1][j]+grid[i][j]，dp[i][j-1]+grid[i][j]}

public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = 0;
        if(m>0)n = grid[0].length;
        int[][] dp = new int[m][n];
        
        for(int i = 0;i<m;i++){
            for(int j =0;j<n;j++){
                if(i == 0 && j == 0){
                   dp[i][j] =  grid[i][j];
                }else if(i == 0){
                    dp[i][j] = dp[i][j-1] + grid[i][j];
                }else if(j == 0){
                    dp[i][j] = dp[i-1][j] + grid[i][j];
                }else{
                    dp[i][j]=(dp[i-1][j]+grid[i][j])<(dp[i][j-1]+grid[i][j])?(dp[i-1][j]+grid[i][j]):(dp[i][j-1]+grid[i][j]);
                }
            }
        }
        return dp[m-1][n-1];
    }