def integerBreak(self, n):
"""
dp[i]表示i的最大乘积是多少,遍历i之前的的范围(1,i-1)相乘找最大值
"""
dp = [0 for i in range(n+1)]
dp[1] = 1
for i in range(2,n+1):
for j in range(1,i):
dp[i] = max(dp[i],max(j * dp[i-j],j*(i-j)))
return dp[n]