math
bwcxljsm
这个作者很懒,什么都没留下…
展开
-
670. Maximum Swap
Given a non-negative integer, you could swap two digits at most once to get the maximum valued number. Return the maximum valued number you could get.Example 1:Input: 2736Output: 7236Explanation: Sw...原创 2018-02-14 16:14:31 · 104 阅读 · 0 评论 -
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 ...原创 2018-03-25 09:42:08 · 107 阅读 · 0 评论