题目:
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.
For example, given n = 2, return 1 (2 = 1 + 1); given n = 10, return 36 (10 = 3 + 3 + 4).
Note: You may assume that n is not less than 2 and not larger than 58.
题意:
将整数n(n>=2)拆分成若干个数的和,求这些拆分后的数相乘的最大结果
代码:
class Solution(object):
def integerBreak(self, n):
"""
:type n: int
:rtype: int
"""
if n < 4 :
return (n-1) #特殊情况
else :
k = 0 #计算n中可以拆分成3的个数,即n中有多少个3通过和的形式组成n
while n > 2 :
k += 1
n -= 3
x = n%3 #n拆分成3的和之后剩余的余数
if x == 1: #如果余1,舍弃一个3,组合成4,乘积更大
return 3**(k-1)*4
if x == 2 : #如果余2,则最后再乘以余下的2
return 3**(k)*2
if x == 0 :
return 3**k #否则,n刚好能拆分成k个3,刚好为k个3相乘
笔记:
直观的感觉,需要将数拆成若干2和3的和的形式,其中,3越多越好,但是具体的细节刚开始没想清楚
参考:http://blog.csdn.net/will130/article/details/51193736