LeetCode 179. Largest Number(排序)

class Solution {
public:
    string largestNumber(vector<int>& nums) {
        
        
        vector<string> strs;
        
        for(int i=0;i<nums.size();i++)
        {
            strs.push_back(to_string(nums[i]));
        }
        
        sort(strs.begin(),strs.end(),compare);
        
        string ans="";
        
        for(int i=0;i<strs.size();i++)
        {
            ans+=strs[i];
        }
        
        if(ans[0]=='0')
            ans="0";
        
        return ans;
    
    }
    
    static int compare(string a,string b)
    {
        string x=a+b;
        string y=b+a;
        
        return x>y;
    }
};