LeetCode.343 整数拆分
dp = [1]*(n+1)
for i in range(3, len(dp)):
for j in range(1, i//2+1):
dp[i] = max(dp[i], j*dp[i-j], j*(i-j))
return dp[-1]
LeetCode.96 不同的二叉搜索树
dp = [0] * (n+1)
dp[0] = 1
for i in range(1, len(dp)):
for j in range(1, i+1):
dp[i] += dp[j-1] * dp[i-j]
return dp[-1]