原理:将一个数等分后,各等分后的数的乘积最大。
如果该数无法等分,就将余数拆分成若n个1平均分配到n个等分数上。
Python方法实现:
def max_product(sum):
mod = sum % 3
a = b = c = (sum - mod) / 3
if mod == 1:
c += 1
elif mod == 2:
b += 1
c += 1
return 'a = %s, b = %s, c = %s, a + b + c = %s' %(a, b, c, a * b * c)
验算:
>>> max_product(180)
'a = 60.0, b = 60.0, c = 60.0, a * b * c = 216000.0'
>>> max_product(179)
'a = 59.0, b = 59.0, c = 61.0, a * b * c = 212400.0'