<awangdev>Unique Binary Search Tree_1.java
public int numTrees(int n) {
        if ( n <= 1) {
            return 1;
        }
        final int[] numTree = new int[n + 1];
        numTree[0] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < i; j++) {
                numTree[i] += numTree[j] * numTree[i - j - 1];
            }
        }
        return numTree[n];
    }
public int sample_funcname ( int var_0 ) {
  if ( var_0 <= 1 ) {
    return 1 ;
  }
  final int [ ] var_2 = new int [ var_0 + 1 ] ;
  var_2 [ 0 ] = 1 ;
  for ( int var_4 = 1 ;
  var_4 <= var_0 ;
  var_4 ++ ) {
    for ( int var_5 = 0 ;
    var_5 < var_4 ;
    var_5 ++ ) {
      var_2 [ var_4 ] += var_2 [ var_5 ] * var_2 [ var_4 - var_5 - 1 ] ;
    }
  }
  return var_2 [ var_0 ] ;
}
