Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.
For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).
Note: You may assume that n is not less than 2 and not larger than 58.
令dp[n]为n对应的最大积
class Solution {
public:
int integerBreak(int n) {
int dp[n+1];
dp[1]=1;
dp[2]=1;
if(n == 2)
return 1;
else if(n > 2)
{
for(int i=3;i<=n;i++)
{
dp[i]=-1;
for(int j=1;j<i;j++)
{
dp[i]=max(j*dp[i-j],max(dp[i],j*(i-j)));
}
}
return dp[n];
}
}
};