Oferta de dedo de espada 14- II. Cortar la cuerda II

Titulo

https://leetcode-cn.com/problems/jian-sheng-zi-ii-lcof/

Ideas

1. Método matemático (no realizado)
2. Reemplace la programación dinámica anterior con BigInteger

Código

import java.math.BigInteger;
class Solution {
    public int cuttingRope(int length) {
        
        if(length<2){
            return 0;
        }
        if(length==2){
            return 1;
        }
        if(length==3){
            return 2;
        }
        BigInteger[] product = new  BigInteger[length+1];
        product[0] = new BigInteger("1");
        product[1] = new BigInteger("1");
        product[2] = new BigInteger("2");
        product[3] = new BigInteger("3");

        BigInteger  max = new BigInteger("0");
        for (int i = 4; i <= length; i++) {
            max = new BigInteger("0");
            for (int j = 1; j <= i / 2; j++) {
                BigInteger temp = product[j].multiply(product[i-j]);
                if(max.compareTo(temp)<0){
                    max = temp;
                }

                product[i] = max;
            }
        }
        return product[length].mod(new BigInteger("1000000007")).intValue();
    }
}