96.Unique Binary Search Trees [LeetCode Java实现]

题目链接：unique-binary-search-trees

import java.util.Arrays;


/**
 * 
		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
 *
 */
public class UniqueBinarySearchTrees {

//	解法一	
//	19 / 19 test cases passed.
//	Status: Accepted
//	Runtime: 171 ms
//	Submitted: 0 minutes ago
	
    static int numTrees(int n) {
        int[] count = new int[n + 1];
        Arrays.fill(count, 0);
        count[0] = 1;
        count[1] = 1;
        for (int i = 2; i <= n; i++) {
			for (int j = 1; j <= i; j++) {
				count[i] += count[j - 1] * count[i - j];
			}
		}
        return count[n];
    }
    
    //解法二：递归版， 会超时
    static int numTrees1(int n) {
    	if(n == 0) return 1;
    	int count = 0;
    	for (int i = 1; i <= n; i++) {
			count += numTrees1(i - 1) * numTrees1(n - i);
		}
        return count;
    }
	public static void main(String[] args) {
		System.out.println(numTrees(19));
		System.out.println(numTrees1(19));
	}

}