Class Solution

Array/LargestNumber.py:49–82

"""
class Solution(object):
    def largestNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: str
        """
        
        if not any(nums):
            return '0'
        
        max_nums = len(str(max(nums)))
        
        # 2
        def mycmp(x, y):
            if x + y > y + x:
                return 1
            else:
                return -1

        # 测试用下面的可以跑过 2 & 3。
        def makeEqual(s, length=max_nums):
            
            if len(s) == length:
                return s
            # 这种补位会通过测试，但是 Leetcode 的测试并没有包含所有的情况。
            x = max(s) * (length - len(s))                
            return s+x
        
        # 2
        return ''.join(sorted(map(str, nums), cmd=mycmp, reverse=True))
        # 3
        return ''.join(sorted(map(str, nums), key=makeEqual, reverse=True))

        # print(sorted(map(str, nums), key=makeEqual, reverse=True))