<awangdev>62. Unique Path_1.java
public int uniquePaths(int m, int n) {
        if (m == 0 || n == 0) return 0;
        int[][] dp = new int[m][n];
        for (int i = 0; i < m; i++) dp[i][0] = 1;
        for (int i = 0; i < n; i++) dp[0][i] = 1;

        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = dp[i - 1][j] + dp[i][j - 1];
            }
        }
        return dp[m-1][n-1];        
    }
public int sample_funcname ( int var_0 , int var_1 ) {
  if ( var_0 == 0 || var_1 == 0 ) return 0 ;
  int [ ] [ ] var_3 = new int [ var_0 ] [ var_1 ] ;
  for ( int var_4 = 0 ;
  var_4 < var_0 ;
  var_4 ++ ) var_3 [ var_4 ] [ 0 ] = 1 ;
  for ( int var_4 = 0 ;
  var_4 < var_1 ;
  var_4 ++ ) var_3 [ 0 ] [ var_4 ] = 1 ;
  for ( int var_4 = 1 ;
  var_4 < var_0 ;
  var_4 ++ ) {
    for ( int var_6 = 1 ;
    var_6 < var_1 ;
    var_6 ++ ) {
      var_3 [ var_4 ] [ var_6 ] = var_3 [ var_4 - 1 ] [ var_6 ] + var_3 [ var_4 ] [ var_6 - 1 ] ;
    }
  }
  return var_3 [ var_0 - 1 ] [ var_1 - 1 ] ;
}
