<awangdev>63. Unique Paths II_1.java
public int uniquePathsWithObstacles(int[][] obstacleGrid) {
        if (obstacleGrid == null || obstacleGrid.length == 0) return 0;
        int m = obstacleGrid.length, n = obstacleGrid[0].length;
        
        int[][] dp = new int[m][n];
        for (int i = 0, j = 0; j < n; j++) {
            if (obstacleGrid[i][j] == 1) break;
            dp[i][j] = 1;
        }
        for (int i = 0, j = 0; i < m; i++) {
            if (obstacleGrid[i][j] == 1) break;
            dp[i][j] = 1;
        }
        
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                if (obstacleGrid[i][j] == 1) continue;
                dp[i][j] = 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 ) 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_8 = 0 ;
  var_8 < var_5 ;
  var_8 ++ ) {
    if ( var_0 [ var_7 ] [ var_8 ] == 1 ) break ;
    var_6 [ var_7 ] [ var_8 ] = 1 ;
  }
  for ( int var_7 = 0 , var_8 = 0 ;
  var_7 < var_4 ;
  var_7 ++ ) {
    if ( var_0 [ var_7 ] [ var_8 ] == 1 ) break ;
    var_6 [ var_7 ] [ var_8 ] = 1 ;
  }
  for ( int var_7 = 1 ;
  var_7 < var_4 ;
  var_7 ++ ) {
    for ( int var_8 = 1 ;
    var_8 < var_5 ;
    var_8 ++ ) {
      if ( var_0 [ var_7 ] [ var_8 ] == 1 ) continue ;
      var_6 [ var_7 ] [ var_8 ] = var_6 [ var_7 - 1 ] [ var_8 ] + var_6 [ var_7 ] [ var_8 - 1 ] ;
    }
  }
  return var_6 [ var_4 - 1 ] [ var_5 - 1 ] ;
}
