LeetCode 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

方法一：递归

The main and natural idea of this solution is to go through vertices and calculate number of combinations 'k' for each of them. k = kLeft * kRight.
Use cache to speed up recursion.

	private int[] cache = new int[100];//cache[k]表示numTrees(int k)的结果

	public int numTrees(int n) {
		if (n <= 1) return 1;
		if (cache[n] > 0) return cache[n];
		int sum = 0;
		for (int i = 1; i <= n; i++) {
			sum += numTrees(i - 1) * numTrees(n - i);//sum等于sumLeft*sumRight
		}
		cache[n] = sum;
		return sum;
	}

参考https://discuss.leetcode.com/topic/39188/no-tricks-java-naive-solution-using-recursion-and-dp-0-ms

方法二：

	public int numTrees2(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];
	}

参考 https://discuss.leetcode.com/topic/8398/dp-solution-in-6-lines-with-explanation-f-i-n-g-i-1-g-n-i，讲解很好。