Open Shawngbk opened 7 years ago
public class Solution { public int minPathSum(int[][] grid) { int m = grid.length; //row int n = grid[0].length; //column for(int i = 0; i < m; i++) { for(int j = 0; j < n; j++) { if(i == 0 && j != 0) { grid[i][j] = grid[i][j] + grid[i][j-1]; } else if(i != 0 && j == 0) { grid[i][j] = grid[i-1][j] + grid[i][j]; } else if(i == 0 && j == 0) { grid[i][j] = grid[i][j]; } else { grid[i][j] = Math.min(grid[i][j-1], grid[i-1][j]) + grid[i][j]; } } } return grid[m-1][n-1]; } }
public class Solution { public int minPathSum(int[][] grid) { int m = grid.length; //row int n = grid[0].length; //column for(int i = 0; i < m; i++) { for(int j = 0; j < n; j++) { if(i == 0 && j != 0) { grid[i][j] = grid[i][j] + grid[i][j-1]; } else if(i != 0 && j == 0) { grid[i][j] = grid[i-1][j] + grid[i][j]; } else if(i == 0 && j == 0) { grid[i][j] = grid[i][j]; } else { grid[i][j] = Math.min(grid[i][j-1], grid[i-1][j]) + grid[i][j]; } } } return grid[m-1][n-1]; } }