<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 {
public:
    string largestNumber(vector<int>& nums) 
    {
        vector<string> str;
        for(int i = 0; i < nums.size(); i++)
        {
            str.push_back(to_string(nums[i]));
        }
        for(int i = 0; i < nums.size() - 1; i++)
        {
            for(int j = 1; j < nums.size() - i; j++)
            {
                if(str[j] + str[j - 1] > str[j - 1] + str[j])
                {
                    swap(str[j], str[j - 1]);
                }
            }
        }
        if(str[0] == "0") return "0";
        string ans;
        for(int i = 0; i < str.size(); i++)
        {
            ans += str[i];
        }
        return ans;
    }
};
15900