lintcode: Largest Number

最新推荐文章于 2024-08-29 11:50:21 发布

martin_liang

最新推荐文章于 2024-08-29 11:50:21 发布

阅读量370

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 C++/C lintcode

本文链接：https://blog.youkuaiyun.com/martin_liang/article/details/51044630

算法同时被 3 个专栏收录

537 篇文章

订阅专栏

C++/C

504 篇文章

订阅专栏

lintcode

66 篇文章

订阅专栏

本文介绍了一种算法，该算法接收一个非负整数列表，并通过重新排列这些整数形成可能的最大数值。文章提供了一个具体示例，例如从[1,20,23,4,8]中生成8423201。此外，还讨论了时间复杂度为O(nlogn)的挑战。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

Have you met this question in a real interview?

Notice

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

Example

Given [1, 20, 23, 4, 8], the largest formed number is 8423201.

Challenge

Do it in O(nlogn) time complexity.


class Solution {
    
private:
    static bool cmp(const string &a,const string &b){
        string ab = a + b;
        string ba = b + a;
        return ab > ba;
    }
    
public:
    /**
     *@param num: A list of non negative integers
     *@return: A string
     */
    string largestNumber(vector<int> &num) {
        // write your code here
        
        vector<string> auxVtr(num.size());
        
        for(int i : num)
            auxVtr.push_back(to_string(i));
        
        sort(auxVtr.begin(), auxVtr.end(), cmp);
        
        string retStr = "";
        for (int i=0; i<auxVtr.size(); i++)
            retStr += auxVtr[i];
            
        if(retStr[0] == '0' && retStr.size() > 0) 
            return "0";
            
        return retStr;
    }
};