class Solution {
public:
int integerBreak(int n) {
vector<int> dp(n + 1);
dp[0] = dp[1] = 0;
for (int i = 2; i <= n; i++) {
int curMax;
for (int j = 1; j < i; j++) {
curMax = max(j * (i - j), j * dp[i - j]);
dp[i] = max(dp[i], curMax);
}
}
int Max = 0;
for (int i = 2; i < n + 1; i++) {
if (dp[i] > Max) {
Max = dp[i];
}
}
return Max;
}
};
LeetCode343. 整数拆分
最新推荐文章于 2024-09-14 22:25:23 发布