leetcode:Largest Number

最新推荐文章于 2021-02-17 06:13:26 发布

原创最新推荐文章于 2021-02-17 06:13:26 发布 · 244 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

leetcode

230 篇文章

订阅专栏

本文介绍了一个算法，用于将一组非负整数排列成最大的数值字符串。通过比较自定义的字符串组合方式，实现从给定数组中形成最大可能的数字。

Given a list of non negative integers, arrange them such that they form the largest number.

For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.

Note: The result may be very large, so you need to return a string instead of an integer.

class Solution(object):
    
    def myCompare(self, s1, s2):
        n1 = int(s1+s2)
        n2 = int(s2+s1)
        
        if n1 < n2:
            return 1
        elif n1 == n2:
            return 0
        else:
            return -1
            
    def largestNumber(self, nums):
        """
        :type nums: List[int]
        :rtype: str
        """
        strList = [str(x) for x in nums]
        strList.sort(cmp = self.myCompare)
        
        while len(strList) > 1 and strList[0] == '0':
            strList = strList[1:]
        
        return "".join(strList)