96. Unique Binary Search Trees

Unique Binary Search Trees

Given n = 3, there are a total of 5 unique BST’s.

给出一个n 主要计算能排出多少种不同的n

代码：

使用了动态规划dp ：sum += dp[j] * dp[i - j - 1];
如果给出2个节点则：sum = dp[0]*dp[1]+dp[1]*dp[0]
如果给出3个节点则：sum = dp[0]*dp[2]+dp[1]*dp[1]+dp[3]*dp[0]

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