class Solution(object):
def numTrees(self, n):
"""
:type n: int
:rtype: int
"""
dp=[0 for x in range(n+1)]
dp[0]=1
dp[1]=1
for i in range(2,n+1):
for j in range(i):
dp[i]+=dp[j]*dp[i-j-1]
return dp[n]
LeetCode-96-Unique Binary Search Trees DP
最新推荐文章于 2021-06-12 01:34:54 发布