LeetCode 刷题记录: 96. Unique Binary Search Trees [Python]

原题

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

Given n, how many structurally unique BST’s (binary search trees) that store values 1 … n?

思路

对于n个值，以i为根，则可以将[1,i-1]放入左边，[i+1,n]放入右边，因此有[i-1]*[i-j]种方式。

代码

class Solution:
    def numTrees(self, n: int) -> int:
        arr=[0]*(n+1)
        arr[0]=1
        for i in range(1,n+1):
            for j in range(1,i+1):
                arr[i]+=arr[j-1]*arr[i-j]
        return arr[-1]

# LeetCode

支付宝

微信

Paypal Buy me a coffee

Jiawei Wang

UAB Grad

Birmingham, AL

文章

分类

标签

关注我

Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

LeetCode 刷题记录: 96. Unique Binary Search Trees [Python]

原题

思路

代码

喜欢这篇文章？打赏一下作者吧

评论

分类

标签

最新文章

归档

最新文章

归档

Your browser is out-of-date!