LeetCode——Unique Binary Search Trees

最新推荐文章于 2021-09-15 15:18:50 发布

yjfanling

最新推荐文章于 2021-09-15 15:18:50 发布

阅读量134

点赞数

分类专栏：算法文章标签： leetcode java

本文链接：https://blog.csdn.net/sinat_22994595/article/details/90114416

版权

算法专栏收录该内容

83 篇文章 0 订阅

订阅专栏

Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?

Example:

Input: 3
Output: 5
Explanation:
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

一个卡塔兰数的列子
在这里插入图片描述

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];
    }
}

Runtime: 0 ms, faster than 100.00% of Java online submissions for Unique Binary Search Trees.
Memory Usage: 32.2 MB, less than 100.00% of Java online submissions for Unique Binary Search Trees.