96. Unique Binary Search Trees

最新推荐文章于 2021-05-17 12:15:23 发布

fourye007

最新推荐文章于 2021-05-17 12:15:23 发布

阅读量199

点赞数

分类专栏： leetcode-c 文章标签： Unique Binary Search Trees

本文链接：https://blog.csdn.net/yzf0011/article/details/77630908

版权

leetcode-c 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

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

int numTrees(int n) {
    if (n <= 0) {
        return 0;
    }
    // 用于计数
    int counts[n + 1];
    counts[0] = 1;
    counts[1] = 1;
    
    
    int inds;
    int partition;
    int tmp_count;
    for (inds = 2; inds <= n; ++inds) {
        tmp_count = 0;
        for(partition = 1; partition <= inds; ++partition) {
            tmp_count += counts[partition - 1] * counts[inds - partition];
        }
        counts[inds] = tmp_count;
    }
    return counts[n];
}

思想：