11 line DP in Java using 4ms


  • 3
    G
        public int minPathSum(int[][] grid) {
        int m=grid.length, n=grid[0].length;
        for(int i=0;i<m;i++){
            for(int j=0;j<n;j++){
                if(i==0 || j==0){
                    if(i==0 && j==0) grid[i][j] = grid[i][j];
                    if(i>0 && j==0) grid[i][j] = grid[i][j]+grid[i-1][j];
                    if(i==0 && j>0) grid[i][j] = grid[i][j] + grid[i][j-1];
                } else grid[i][j] = grid[i][j] + Math.min(grid[i][j-1], grid[i-1][j]);
            }
        }
        return grid[m-1][n-1];
    }

  • 1
    T

    Good solution - But I want to mention that modifying the original array might not be always desirable.


Log in to reply
 

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