python版 剪绳子 动态规划 # -*- coding:utf-8 -*- class Solution: def cutRope(self, number): # write code here #动态规划 dp=[0]*(number+1) for i in range(2,number+1): #从长度为2到长度为number计算乘积 for j in range(1,i):# 每次可剪j的长度,j从1变换到i-1 dp[i]=max(dp[i],j*ma...