c++自定义排序

class Solution {
    void quickSort(vector& strs, int l, int r)
    {
        if (l >= r) return;
        int i = l, j = r;
        while (i < j)
        {
            while(strs[j] + strs[l] >= strs[l] + strs[j] && i < j) j--;
            while(strs[i] + strs[l] <= strs[l] + strs[i] && i < j ) i++;
            swap(strs[i], strs[j]);
        } 
        swap(strs[l], strs[i]);
        quickSort(strs, l, i - 1);
        quickSort(strs, i + 1, r);
    }
public:
    string minNumber(vector& nums) {
        vector strs;
        for (const auto & e : nums) {
            strs.push_back(to_string(e));
        }
        quickSort(strs, 0, strs.size() - 1);
        string res;
        for(string s : strs) {
            res.append(s);
        }
        return res;
    }
};

class Solution {
public:
    string minNumber(vector& nums) {
        vector strs;
        for (const auto & e : nums) {
            strs.push_back(to_string(e));
        }
        // quickSort(strs, 0, strs.size() - 1);
        sort(strs.begin(), strs.end(), [](string& x, string& y) { return x + y < y + x; });
        string res;
        for(string s : strs) {
            res.append(s);
        }
        return res;
    }
};