leetcode 343. Integer Break

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.
相關文章
相關標籤/搜索