LeetCode 96. Unique Binary Search Trees

LeetCode 96. Unique Binary Search Trees

题目

Given an integer n, return the number of structurally unique BST’s (binary search trees) which has exactly n nodes of unique values from 1 to n.

题目大意

给定一个整数n，返回有n个节点的二叉搜索树的个数。

样例

Example 1:

Input: n = 3
Output: 5

Example 2:

Input: n = 1
Output: 1

思路

动态规划，dp[i]表示i个节点的二叉搜索树的个数，dp[i] = dp[0] * dp[i-1] + dp[1] * dp[i-2] + … + dp[i-1] * dp[0]。

代码

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