Leetcode 179 Maximum number (2022.06.28)

Given a set of nonnegative integers nums, Rearrange the order of each number （ Each number cannot be split ） Make it the largest integer .

Be careful ： The output can be very large , So you need to return a string instead of an integer .

Example 1：

Input ：nums = [10,2]
Output ：“210”
Example 2：

Input ：nums = [3,30,34,5,9]
Output ：“9534330”

Tips ：

1 <= nums.length <= 100
0 <= nums[i] <= 109

source ： Power button （LeetCode）
link ：https://leetcode.cn/problems/largest-number

C++ Submission ：

class Solution {
    
public:
    string largestNumber(vector<int> &nums) {
    
        sort(nums.begin(), nums.end(), [](const int &x, const int &y) {
    
            long sx = 10, sy = 10;
            while (sx <= x) {
    
                sx *= 10;
            }
            while (sy <= y) {
    
                sy *= 10;
            }
            return sy * x + y > sx * y + x;
        });
        if (nums[0] == 0) {
    
            return "0";
        }
        string ret;
        for (int &x : nums) {
    
            ret += to_string(x);
        }
        return ret;
    }
};