<awangdev>64. Minimum Path Sum_3.java
public int minPathSum(int[][] grid) {
        if (grid == null || grid.length == 0 || grid[0] == null || grid[0].length == 0) return 0;
        int m = grid.length, n = grid[0].length;
        int[][] dp = new int[m][n];

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                dp[i][j] = grid[i][j]; 
                if (i == 0 && j == 0) continue;    
                if (i == 0 && j > 0) dp[i][j] += dp[i][j - 1];
                else if (i > 0 && j == 0) dp[i][j] += dp[i - 1][j];
                else dp[i][j] += Math.min(dp[i - 1][j], dp[i][j - 1]); 
            }
        }
        return dp[m - 1][n - 1];
    }
public int sample_funcname ( int [ ] [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 || var_0 [ 0 ] == null || var_0 [ 0 ] . length == 0 ) return 0 ;
  int var_4 = var_0 . length , var_5 = var_0 [ 0 ] . length ;
  int [ ] [ ] var_6 = new int [ var_4 ] [ var_5 ] ;
  for ( int var_7 = 0 ;
  var_7 < var_4 ;
  var_7 ++ ) {
    for ( int var_8 = 0 ;
    var_8 < var_5 ;
    var_8 ++ ) {
      var_6 [ var_7 ] [ var_8 ] = var_0 [ var_7 ] [ var_8 ] ;
      if ( var_7 == 0 && var_8 == 0 ) continue ;
      if ( var_7 == 0 && var_8 > 0 ) var_6 [ var_7 ] [ var_8 ] += var_6 [ var_7 ] [ var_8 - 1 ] ;
      else if ( var_7 > 0 && var_8 == 0 ) var_6 [ var_7 ] [ var_8 ] += var_6 [ var_7 - 1 ] [ var_8 ] ;
      else var_6 [ var_7 ] [ var_8 ] += Math . min ( var_6 [ var_7 - 1 ] [ var_8 ] , var_6 [ var_7 ] [ var_8 - 1 ] ) ;
    }
  }
  return var_6 [ var_4 - 1 ] [ var_5 - 1 ] ;
}
