【leetcode每日刷题】96. Unique Binary Search Trees

https://leetcode.com/problems/unique-binary-search-trees/

假设n个数字的BST个数为G(n)，n个数字且第i个数字为根的BST个数为F(n,i)，递推公式为F(n,i) = G(i-1) * G(n-i)，那么从前往后求出G(n) = sum(G(i-1) * G(n-i))

class Solution(object):
    def numTrees(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n == 0 or n == 1:
            return 1
        F = [0 for _ in range(n+1)]
        F[0] = 1
        F[1] = 1
        for i in range(2, n+1):
            for j in range(1, i+1):
                F[i] += F[j-1] * F[i-j]
        return F[n]

if __name__ == "__main__":
    solution = Solution()
    n = 3
    print(solution.numTrees(n))