剑指Offer:剪绳子

    public int cutRope(int target) {
        int[] dp = new int[target+1];
        Arrays.fill(dp, 1);
        if(target==3)
        	return 2;
        for(int i=3; i <= target;i++){
            for(int j = 1;j <= i;j++){
            	dp[i] = Math.max(dp[i],dp[i-j]*j);
            }
        }
        return dp[target];
    }