Python 4 lines incremental DP


  • 0
    N
    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]
    

Log in to reply
 

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