<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>num;
        for(int i=0;i<nums.size();i++){
            num.push_back(to_string(nums[i]));
        }
        for(int i=0;i<num.size()-1;i++){
            for(int j=0;j<num.size()-1;j++){
                string s1=num[j]+num[j+1];
                string s2=num[j+1]+num[j];
                if(s2>s1){
                    string temp=num[j];
                    num[j]=num[j+1];
                    num[j+1]=temp;
                }

            }
        }
        string s="";
        for(int i=0;i<num.size();i++){
            s+=num[i];
        }
        if(num[0]=="0"){
            return "0";
        }
        
        return s;
        
    }
};
15900