题目:
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.
思路:
我是用的动态规划,但实际上背后存在一个数学问题,参考https://leetcode.com/problems/integer-break/discuss/80721/Why-factor-2-or-3-The-math-behind-this-problem.。
代码实现:
class Solution {
public:
int max(int a, int b, int c){
int ret = a;
if (b > ret){
ret = b;
}
if (c > ret){
ret = c;
}
return ret;
}
int integerBreak(int n) {
vector<int> dp(n+1, 0);
dp[1] = 1;
for (int i = 1; i <= n; ++i){
for (int j = 1; j < i; ++j){
dp[i] = max(dp[i], dp[i-j]*j, (i-j)*j);
}
}
return dp[n];
}
};
实际上还可以稍稍优化。