[leetcode] 343. Integer Break

题目

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).

python代码

class Solution(object):
    def integerBreak(self, n):
        """
        :type n: int
        :rtype: int
        """
        if n==2:
            return 1
        if n==3:
            return 2

        product = 1
        while n> 4:
            product*=3
            n-=3

        product*=n
        return product

http://www.zhihu.com/question/30071017?sort=created