Sword finger offer 14- I. cut rope

class Solution {
    
    public int cuttingRope(int n) {
    
        //dp[i]  The length is i Rope generation for m The maximum product of segments is ？i For state 
        int dp[]=new int[n+2];

        dp[2]=1;

        for(int i=3;i<=n;i++){
    
            //1<=j<i
            for(int j=1;j<i;j++){
    
                // After cutting this paragraph , You can choose to continue cutting , You can also choose not to cut 
                dp[i]=Math.max(Math.max(j*dp[i-j],j*(i-j)),dp[i]);
            }
        }
        return dp[n];

    }
}