96. Unique Binary Search Trees

Given n, how many structurally unique BST's (binary search trees) that store values 1...n?

For example,
Given n = 3, there are a total of 5 unique BST's.

   1         3     3      2      1
    \       /     /      / \      \
     3     2     1      1   3      2
    /     /       \                 \
   2     1         2                 3

Subscribe to see which companies asked this question

先找根节点 然后左右可以的方式相乘

public class Solution {
    int [] record=new int [999];
    public int numTrees(int n) {
        if(n==0)return 1;
        if(record[n]!=0)return record[n];
        int ret = 0;
        int i = 1;
        while(i<=n){
            ret+=numTrees(i-1)*numTrees(n-i);
            i++;
        }
        record[n]=ret;
        return ret;
    }
}