代码随想录训练营第III期--041--python

# 代码随想录训练营第III期--041--python


#  343. 整数拆分 
class Solution:
    def integerbreak(self, n):
        # dp = [[0] for _ in range(n+1)] # 参数传递
        dp = [0] * (n+1)
        for i in range(2,n+1):
            for j in range(i):
                dp[i] = max(dp[i], j*(i-j), j*dp[i-j])
        return dp[n]

sl = Solution()
n = 2 
print(sl.integerbreak(n))


#  96.不同的二叉搜索树 
# 不会，收藏了，以后再说
class Solution:
    def numTrees(self,n):
        dp = [0] * (n+1)
        dp[0] = 1 
        for i in range(1,n+1):
            for j in range(1, i+1):
                dp[i] += dp[j-1] * dp[i-j]

        return dp[n]

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30