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