问题描述
看n个点能组成多少个二叉搜索树
class Solution:
def numTrees(self, n: int) -> int:
dp = [0]*(n+1)
dp[0] = 1
dp[1] = 1
for i in range(2,n+1):
for j in range(0,i):
dp[i] += dp[j]*dp[i-j-1]
return dp[n]
运行结果·: