class Solution {
public int cuttingRope(int n) {
if (n <= 1) {
return 0;
}
if (n == 2) {
return 1;
}
if (n == 3) {
return 2;
}
int[] dp = new int[n + 1];
for (int i = 0; i < 4; i++) {
dp[i] = Math.max(i, cuttingRope(i));
}
for (int i = 4; i <= n; i++) {
for (int j = 1; j <= i / 2; j++) {
dp[i] = Math.max(dp[i], dp[j] * dp[i - j]);
}
}
return dp[n];
}
}