[Leetcode] Integer Break 分解整數最大乘積

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

>>阅读原文<<