leetcode179 Largest Number

"""
Given a list of non negative integers, arrange them such that they form the largest number.
Example 1:
Input: [10,2]
Output: "210"
Example 2:
Input: [3,30,34,5,9]
Output: "9534330"
"""
"""
用冒泡排序的思想，两两结合进行比较，如果小则交换位置
注意需要转为str结合再转为int比较
"""
class Solution:
    def largestNumber(self, nums):
        res = ''
        for i in range(len(nums)):
            for j in range(i+1, len(nums)):
                if int(str(nums[i])+str(nums[j])) < int(str(nums[j])+str(nums[i])):#!!!
                    nums[i], nums[j] = nums[j], nums[i]
        if nums[0] == 0: ##bug Input: [0, 0] Output: "00" Expected: "0"
            return '0'
        for i in range(len(nums)):
            res += str(nums[i])
        return res