Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

def numTrees(self, n): dp = [0 for i in range(n+1)] dp[0] = dp[1] = 1 for i in range(2, n+1) : for j in range(i) : dp[i] += dp[j] * dp[(i-1)-j] return dp[-1]

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.