Unique Binary Search Trees

最新推荐文章于 2020-05-14 15:03:49 发布

原创最新推荐文章于 2020-05-14 15:03:49 发布 · 145 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Unique Binary Search Trees

leetcode 同时被 2 个专栏收录

211 篇文章

订阅专栏

递归

36 篇文章

订阅专栏

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)
{
vector<int> result;
result.push_back(1);
result.push_back(1);
for(int i=2;i<=n;i++)
{
int sum=0;
for(int j=1;j<=i;j++)
{
sum+=(result[j-1]*result[i-j]);
}
result.push_back(sum);
}
return result.back();
}
};