leetcode[96]:Unique Binary Search Trees

最新推荐文章于 2015-07-28 21:34:10 发布

hahubaba

最新推荐文章于 2015-07-28 21:34:10 发布

阅读量295

点赞数

分类专栏： leetcode 文章标签： binary tree DP

本文链接：https://blog.csdn.net/hahubaba/article/details/47070181

版权

leetcode 专栏收录该内容

86 篇文章 0 订阅

订阅专栏

Unique Binary Search Trees

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) {
    int res=0,i;
    if(n==0) return 1;
    if(n==1) return 1;
    if(n==2) return 2;
    for(i=1;i<n/2+1;i++)
    {
        res+=numTrees(i-1)*numTrees(n-i);
    }
    if(n%2==1) res=res*2+numTrees((n-1)/2)*numTrees((n-1)/2);
    else res=res*2;
    return res;
}