题解 | #剪绳子#

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