来个python的,大概在60ms, 一个很巧的比较方法,我是想不出来 - -,参考人家的。
https://www.geeksforgeeks.org/ar ... ggest-number-set-2/- class Solution:
-
- def largestNumber(self,nums):
- l = len(str(max(nums)))+1
- new = [((str(i)*l)[:l],str(i)) for i in nums]
- new.sort(reverse = True)
- res = "".join([i[1] for i in new])
- return "0" if res[0]=="0" else res
复制代码
|