Leetcode 179. Largest Number (Medium) (cpp)

最新推荐文章于 2021-04-14 08:40:45 发布

Niko_Ke

最新推荐文章于 2021-04-14 08:40:45 发布

阅读量387

点赞数

分类专栏： Leetcode C++ C++ Leetcode Sort 文章标签： leetcode cpp

本文链接：https://blog.csdn.net/Niko_Ke/article/details/52622220

版权

C++ 同时被 3 个专栏收录

299 篇文章 0 订阅

订阅专栏

Leetcode C++

287 篇文章 0 订阅

订阅专栏

Leetcode Sort

14 篇文章 0 订阅

订阅专栏

Leetcode 179. Largest Number (Medium) (cpp)

Tag: Sort

Difficulty: Medium

/*

179. Largest Number (Medium)

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 {
public:
    string largestNumber(vector<int>& nums) {
        string res;
        sort(nums.begin(), nums.end(), comp);
        if (nums[0] == 0) return "0";
        for (int num : nums)
            res += to_string(num);
        return res;
    }
    static bool comp(int i, int j) {
        return to_string(i) + to_string(j) > to_string(j) + to_string(i);
    } 
};