64. 最小路径和

https://leetcode-cn.com/problems/minimum-path-sum/

• 动态规划

  public int minPathSum(int[][] grid) {
      if(grid==null||grid.length==0||grid[0].length==0)return 0;
      int[][] dp = new int[grid.length][grid[0].length];
      dp[0][0] = grid[0][0];
      for(int i=1;i<grid[0].length;i++){
          dp[0][i] = grid[0][i]+dp[0][i-1];
      }
      for(int i=1;i<grid.length;i++){
          dp[i][0] = grid[i][0]+dp[i-1][0];
      }
      for(int i=1;i<grid.length;i++){
          for(int j=1;j<grid[0].length;j++){
              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];
  }