leetcode Unique Binary Search Trees

最新推荐文章于 2019-11-27 21:14:45 发布

piyalo

最新推荐文章于 2019-11-27 21:14:45 发布

阅读量154

点赞数

分类专栏： leetcode，DP

本文链接：https://blog.csdn.net/qq_33755214/article/details/78828447

版权

leetcode，DP 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

Description:

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

Solution:

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