zoukankan      html  css  js  c++  java
  • LeetCode

    Unique Binary Search Trees

    2013.12.31 18:37

    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

    Solution:

      See the definition for Catalan Number here, and that's the answer for this problem.

      So, this problem is just to test if you know the term Catalan Number. If you do know the math formula, you won't use recurrence relation to calculate it, but use combinatorial number as a faster solution.

      Time complexity is O(n), as calculating C(n, k) requires O(k) complexity, and F(n) = C(2n, n) / (n + 1).

      Space complexity is O(1).

    Accepted code:

     1 class Solution {
     2 public:
     3     int numTrees(int n) {
     4         // Note: The Solution object is instantiated only once and is reused by each test case.
     5         // res = C(2 * n, n) / (n + 1)
     6         return combination(2 * n, n) / (n + 1);
     7     }
     8 private:
     9     int combination(int n, int k) {
    10         int i;
    11         int res, quo;
    12         
    13         if(k > n / 2){
    14             return combination(n, n - k);
    15         }
    16 
    17         res = quo = 1;
    18         for(i = 1; i <= k; ++i){
    19             res *= (n + 1 - i);
    20             quo *= i;
    21             if(res % quo == 0){
    22                 res /= quo;
    23                 quo = 1;
    24             }
    25         }
    26 
    27         return res;
    28     }
    29 };
  • 相关阅读:
    JDBC学习笔记
    hdfs文件格式
    全国疫情防控监控平台开发
    MySQL学习笔记
    拖拽表单生成
    Cython加密(含Windows和Linux)
    pcl 文字点云
    新装Ubuntu系统--常用软件安装配置
    GIT
    Data Analysis With Python
  • 原文地址:https://www.cnblogs.com/zhuli19901106/p/3499924.html
Copyright © 2011-2022 走看看