- 博客(1)
- 收藏
- 关注
原创 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
2016-05-12 21:29:46 234
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人