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.
public class Solution {
public int integerBreak(int n) {
int[] dp=new int[n+1];
dp[0]=0;dp[1]=1;
for(int i=2;i<=n;i++){
dp[i]=Integer.MIN_VALUE;
for(int j=i-1;j>0;j--){//因为这里是从i-1 到0做循环 而没有考虑i单独作为一个数出现 所有后面是Math.max(dp[i-j],i-j)
dp[i]=Math.max(dp[i],j*Math.max(dp[i-j],i-j));
// dp[i]=Math.max(dp[i],Math.max(j,dp[j])*Math.max(dp[i-j],i-j));
}
}
return dp[n];
}
}