LeetCode 0179 - Largest Number

Reck Zhang

发布于 2021-08-11 14:53:06

1910

发布于 2021-08-11 14:53:06

文章被收录于专栏：Reck Zhang

Largest Number

Desicription

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"

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

Solution

class Solution {
public:
    string largestNumber(vector<int>& nums) {
        vector<string> s;
        for(auto it : nums)
            s.push_back(to_string(it));
        sort(s.begin(), s.end(), [](string a, string b){return a + b > b + a;});
        string res;
        for(auto it : s)
            res += it;
        while(res[0] == '0' && res.size() > 1)
            res.erase(0, 1);
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-04，如有侵权请联系 cloudcommunity@tencent.com 删除

form