class Solution {
    public int cuttingRope(int n) {
        int[] dp = new int[n + 1]; // dp[i]表示长度为i的绳子能得到的最大乘积
        dp[2] = 1;

        for(int i = 3; i <= n; i++){
            for(int j = 2; j < i; j++){
                dp[i] = Math.max(dp[i], Math.max(j * (i - j), j * dp[i - j]));
            }
        }

        return dp[n];
    }
}

class Solution {
    public int cuttingRope(int n) {
        if(n == 2) return 1;
        if(n == 3) return 2;
        int res = 1;

        while(n > 4){
            n -= 3;
            res *= 3;
        }

        res *= n;
        return res;
    }
}