NC111 最大数（C++）- 中等、排序

题目链接：https://www.nowcoder.com/practice/fc897457408f4bbe9d3f87588f497729?tpId=196&rp=1&ru=%2Fexam%2Foj&qru=%2Fexam%2Foj&sourceUrl=%2Fexam%2Foj%3Fpage%3D2%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D196&difficulty=&judgeStatus=&tags=&title=111&gioEnter=menu
题目如下：

class Solution {
public:
    /**
     * 最大数
     * @param nums int整型vector 
     * @return string字符串
     */
    static bool cmp(string a,string b){
        return a+b>b+a;
    }
    string solve(vector<int>& nums) {
        //思想：从前往后依次两两排序，得到最大的string
        
        //现将整型转换为string型
        vector<string> vtr;
        for(auto e:nums){
            vtr.push_back(to_string(e));
        }
        
        //排序
        sort(vtr.begin(),vtr.end(),cmp);
        if(vtr[0]=="0") return "0";//特例
        
        //字符串的拼接
        string res="";
        for(auto e:vtr){
            res+=e;
        }
        
        return res;
    }
};