Unique Binary Search Trees

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

SUN_DRAGON

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

阅读量830

点赞数

分类专栏： C++

本文链接：https://blog.csdn.net/SUN_DRAGON/article/details/9858841

版权

C++ 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Unique Binary Search Trees Aug 27 '12 3164 / 5973

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

class Solution {
public:
    int mh[10000];
    int h(int n)
    {
        if(mh[n] != 0)
            return mh[n];
        mh[n] = (4*n-2)*h(n-1) / (n + 1);
        return mh[n];
    }
    int numTrees(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        mh[1] = 1;
        mh[0] = 1;
        return h(n);
    }
};