leetcode: Unique Binary Search Trees

最新推荐文章于 2019-01-07 22:10:41 发布

martin_liang

最新推荐文章于 2019-01-07 22:10:41 发布

阅读量659

点赞数

分类专栏：算法 leetcode C++/C

本文链接：https://blog.csdn.net/martin_liang/article/details/8937626

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

leetcode

230 篇文章 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

class Solution {
public:
    int numTrees(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (n == 1)
            return 1;
            
        if (n == 2)
            return 2;
        
        int totalNum = 0;
        
        for (int i=1; i<=n; i++)
        {
            int left;
            int right;
            
            if (i == 1 || i == n)
            {
                totalNum += numTrees(n-1);
            }
            else
            {
                totalNum += numTrees(i-1)*numTrees(n-i);
            }
        }
        return totalNum;  
    }
};