【Leetcode】Unique Binary Search Tree in JAVA

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

解决这个问题，必须首先明白什么是BST。就是你找一个数字作为根节点，然后左子树小于它（但是左子树的右子树要大于左子树）右子树要大于它~

然后~~~我们就开始找规律

numTrees[0]=1

numTrees[1]=1

numTress[2]=2

numTrees[3]=5

numTrees[4]=14

numTrees[n]=ΣnumTrees[0...n-1]*numTrees[n-1..0]

然后事情就简单了！递归！

public int numTrees(int n) {
        if(n==0)	return 1;
        if(n==1)	return 1;
        return helper(n);
    }
	private int helper(int n){
		int result=0;
		for(int i=0;i<n;i++){
			result+=numTrees(i)*numTrees(n-i-1);
		}
		return result;
	}