g0301_0400.s0343_integer_break.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g0301_0400.s0343_integer_break;
// #Medium #Dynamic_Programming #Math #Algorithm_II_Day_18_Dynamic_Programming
// #Dynamic_Programming_I_Day_21 #2022_07_10_Time_0_ms_(100.00%)_Space_40.7_MB_(67.02%)
public class Solution {
private int[] arr;
public int integerBreak(int n) {
arr = new int[n + 1];
arr[2] = 1;
// only case involve with 1 other than 2 is 3
return n == 3 ? 2 : dp(n);
}
private int dp(int n) {
if (n <= 2) {
return arr[2];
} else if (arr[n] != 0) {
return arr[n];
} else {
int prod = 1;
for (int i = 2; i <= n; i++) {
prod = Math.max(prod, i * dp(n - i));
}
arr[n] = prod;
}
return arr[n];
}
}