class Solution {
public:
/*
* dp[i] 表示拆分 i 的乘积最大值
* 递推公式:dp[i] = max(dp[i], max(j*(i-j), j*dp[i-j]));
* 初始化:dp[0] = 0; dp[1] = 0;
* 遍历顺序:从前往后
*/
int integerBreak(int n) {
vector<int> dp(n+1);
dp[2] = 1;
for (int i = 3; i <= n; i++) {
for (int j = 1; j <= i/2; j++){
dp[i] = max(dp[i], max(j * (i - j), j * dp[i - j]));
}
}
return dp[n];
}
};
时间复杂度O(n^2)
空间复杂度O(n)
贪心
class Solution {
public:
int integerBreak(int n) {
if (n == 2) return 1;
if (n == 3) return 2;
if (n == 4) return 4;
int result = 1;
while(n > 4) {
result *=3;
n -= 3;
}
result *= n;
return result;
}
};