Unique Binary Search Trees
Description:
Given n, how many structurally unique BSTs (binary search trees) that store values 1…n?
Example
Given n = 3, there are a total of 5 unique BST’s.
1 3 3 2 1
\ / / / \ \
3 2 1 1 3 2
/ / \ \
2 1 2 3
Code:
class Solution:
"""
@param n: An integer
@return: An integer
"""
def numTrees(self, n):
# write your code here
dp = [1,1,2,5]
if n <=3:
return dp[n]
else:
for i in range(4, n+1):
dp.append(0)
for j in range(i):
dp[i]+=dp[j]*dp[i-j-1]
return dp[n]