题目描述:
给定一组非负整数,重新排列它们的顺序使之组成一个最大的整数。
示例1:
输入:[10,2]
输出:210
示例2:
输入:[3,30,34,5,9]
输出:9534330
class Solution(object):
def largestNumber(self, nums):
"""
:type nums: List[int]
:rtype: str
"""
#思想:使用冒泡法,对于[a,b]中若a+b < b+a,则将a,b的顺序进行交换
for i in range(len(nums)-1):
for j in range(0,len(nums)-1-i):
if str(nums[j])+str(nums[j+1]) < str(nums[j+1])+str(nums[j]):
temp = nums[j]
nums[j] = nums[j+1]
nums[j+1] = temp
res = ""
for i in range(len(nums)):
res = res+str(nums[i])
return str(int(res))
菜鸟一枚,代码仅供参考,如有问题,望指正~