@@ -0,0 +1,625 @@
+class Solution:%0A    # @param %7Binteger%5B%5D%7D nums%0A    # @return %7Bstring%7D%0A    def largestNumber(self, nums):%0A        nums = sorted(nums, cmp = self.compare)%0A        res, j = '', 0%0A        for i in range(len(nums) - 1):%0A            if nums%5Bi%5D != 0:%0A                break%0A            else:%0A                j += 1%0A        for k in range(j, len(nums)):%0A            res += str(nums%5Bk%5D)%0A                %0A        return res%0A    %0A    def compare(self, x, y):%0A        tmp1, tmp2 = str(x) + str(y), str(y) + str(x)%0A        res= 0%0A        if tmp1 %3E tmp2:%0A            res = -1%0A        elif tmp1 %3C tmp2:%0A            res = 1%0A        return res%0A

Create LargestNumber_001.py