Java DP solution


  • 0
    D
    public class Solution {
        public int minPathSum(int[][] grid) {
            int dp[][] = new int[grid.length][grid[0].length];
            dp[0][0] = grid[0][0];
            for (int i = 0; i < grid.length; i++) {
                for (int j = 0; j <grid[0].length ; j++) {
                    if(i==0&&j==0){
                        continue;
                    }
                    if(i==0){
                        dp[i][j]=grid[i][j]+dp[i][j-1];
                    }else
                    if(j==0){
                        dp[i][j]=grid[i][j]+dp[i-1][j];
                    }else{
                        dp[i][j]=grid[i][j]+Math.min(dp[i-1][j],dp[i][j-1]);
                    }
                }
            }
            return dp[grid.length-1][grid[0].length-1];
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.