[LeetCode]Unique Binary Search Trees@Python

最新推荐文章于 2021-09-21 20:47:47 发布

Goofiness

最新推荐文章于 2021-09-21 20:47:47 发布

阅读量90

点赞数

分类专栏： leetcode dynamic programming 文章标签： leetcode python

本文链接：https://blog.csdn.net/byr_wy/article/details/95352955

版权

leetcode 同时被 2 个专栏收录

232 篇文章 0 订阅

订阅专栏

dynamic programming

43 篇文章 0 订阅

订阅专栏

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:

Solution

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