Leetcode343

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. Example 1: Input:

>>阅读原文<<