leetcode---最大数

class Solution:
    def largestNumber(self,nums):
        res=[]
        for i in nums:
            res.append(str(i))
        for passnum in range(len(res)-1,0,-1):
            for i in range(passnum):
                if int(res[i]+res[i+1])<int(res[i+1]+res[i]):   #将大的数提至前面来
                    temp=res[i]
                    res[i]=res[i+1]
                    res[i+1]=temp
        if res[0]=="0":
            return "0"
        return "".join(res)