LeetCode 96 Unique Binary Search Trees (卡特兰数)

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

 

题目链接：https://leetcode.com/problems/unique-binary-search-trees/

题目分析：n个节点的二叉树形态，卡特兰数，C(2n,n)-C(cn,n-1)

推导：设f(n)为有n个节点时的形态数，容易得到

f(0) = 1, f(1) = 1, f(2) = 2

当n等于3时，固定一个根节点，将剩余的n-1个节点分别分给左右子树，根据乘法原理可得

f(3) = f(0)*f(2) + f(1)*f(1) + f(2)*f(0)

一般的：f(n) = f(0)f(n-1) + f(1)f(n-2) + ... + f(n-2)f(1)+f(n-1)f(0)

class Solution {
    
    public int C(int n, int k) {
        long a = 1, b = 1;
        for (int i = 1; i <= k; i++) {
            a *= (n + 1 - i);
            b *= i;
            if (a % b == 0) {
                a /= b;
                b = 1;
            }
        }
        return (int)(a / b);
    }
    
    public int numTrees(int n) {
        return C(n << 1, n) - C(n << 1, n - 1);
    }
}