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).

class Solution(object): dp = [1, 1, 2, 5] def numTrees(self, n): for i in xrange(len(self.dp), n+1): self.dp.append(sum(self.dp[j] * self.dp[i-1-j] for j in xrange(i))) return self.dp[n]

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