/* *96. Unique Binary Search Trees */ public int numTrees(int n) { int [] G = new int[n+1]; G[0] = G[1] = 1; for(int i=2; i<=n; ++i) { for(int j=1; j<=i; ++j) { G[i] += G[j-1] * G[i-j]; } } return G[n]; }
96. Unique Binary Search Trees
原文：http://www.cnblogs.com/zmyvszk/p/5496828.html