题目
- Largest Number
Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.
Since the result may be very large, so you need to return a string instead of an integer.
Example 1:
Input: nums = [10,2]
Output: “210”
Example 2:
Input: nums = [3,30,34,5,9]
Output: “9534330”
Constraints:
1 <= nums.length <= 100
0 <= nums[i] <= 109
题解
首先把输入转换为字符串列表,然后考虑任意情况下两个相邻的字符串s1, s2. 如果s1+s2<s2+s1,那么将s1和s2的位置交换,直接拼接字符串所得的结果字符串一定是更大的。
这个时候我们意识到,在基于交换的排序算法中,我们所需的唯一参数cmp(即是否交换的准则)已经确定了。那么直接套用一种基于交换的排序(比如快排),就可以直接实现我们的需求。
针对这道题目,还要额外处理最终字符串以0开头的问题。AC的Python3代码如下:
from functools import cmp_to_key
def cmp(s1, s2):
if s1+s2 > s2+s1: return -1
elif s1+s2 < s2+s1: return 1
else: return 0
class Solution:
def largestNumber(self, nums: List[int]) -> str:
nums = [str(n) for n in nums]
nums.sort(key=cmp_to_key(cmp))
ret = ''.join(nums)
while ret[0] == "0" and len(ret) > 1: ret = ret[1:]
return ret