【leetcode 优先队列 C++】【剑指 Offer】 45. 把数组排成最小的数

剑指 Offer 45. 把数组排成最小的数

class Solution {
public:
    struct cmp{
        bool operator ()(string str1, string str2) {
            return str1 + str2 > str2 + str1;
        }
    };
    string minNumber(vector<int>& nums) {
        priority_queue<string, vector<string>, cmp> Q;
        for(auto num : nums) Q.push(to_string(num));
        string ans = "";
        while(!Q.empty()) {
            ans += Q.top();
            Q.pop();
        }
        return ans;
    }
};

class Solution {
public:
    struct cmp{
        bool operator ()(string str1, string str2) {
            int len1 = str1.size(), len2 = str2.size();
            int min_len = min(len1, len2);
            if(len1 == len2 || str1.substr(0, min_len) != str2.substr(0, min_len)) return str1 > str2;
            if(len1 > len2) return operator ()(str1.substr(min_len), str2);
            return operator ()(str1, str2.substr(min_len));
        }
    };
    string minNumber(vector<int>& nums) {
        priority_queue<string, vector<string>, cmp> Q;
        for(auto num : nums) Q.push(to_string(num));
        string ans = "";
        while(!Q.empty()) {
            ans += Q.top();
            Q.pop();
        }
        return ans;
    }
};