class Solution {
public int integerBreak(int n) {
int[] dp = new int [n+1];
int[] val = new int [n+1];
dp[1] = 1;
val[1] = 1;
for(int i = 2;i <= n;i++)
{
int mid = i/2;
for(int j =1;j<=mid;j++)
{
dp[i] = Math.max(dp[i],val[j] * val[i-j]);
}
val[i] = Math.max(dp[i],i);
}
return dp[n];
}
}
LeetCode-343 整数拆分
于 2021-11-16 12:51:35 首次发布