<p>Given a list of non-negative integers <code>nums</code>, arrange them such that they form the largest number and return it.</p>

<p>Since the result may be very large, so you need to return a string instead of an integer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [10,2]
<strong>Output:</strong> &quot;210&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [3,30,34,5,9]
<strong>Output:</strong> &quot;9534330&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 100</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
private:
    static long long int compare( int a, int b){
        long long int n = a;
        if(a == b){
            n = a + b;
        }
        else{
            int c = b;
            int k = b == 0;
            while (c){
                c /= 10;
                k++;
            }
            for (int i = 0; i < k; i++){
                n *= 10;
            }
            n=n+b;
        }
        return n;
    }
    static bool cmp(int f, int s){
        return compare(f, s) > compare(s, f);
    }
public:
    string largestNumber(vector<int>& nums) {
        sort(nums.begin(), nums.end(), cmp);
        if (nums[0] == 0) return "0";
        int n = nums.size();
        string ans;
        for (const auto& t : nums){
            ans.append(to_string(t));
        }
        return ans;
    }
};
14600