leetcode-96. Unique Binary Search Trees

https://leetcode.com/problems/unique-binary-search-trees/#/description

代码如下：

思路解析：未完！！！！！！！！！！！！！！！！！！！！！

public class Solution {    public int numTrees(int n) {        int[] d=new int[n+1];        d[0]=1;        d[1]=1;        for(int i=2;i<=n;i++)        {            for(int root=1;root<=i;root++)            {               d[i]+=d[root-1]*d[i-root];             }        }        return d[n];            }}