class Solution {
public:
string PrintMinNumber(vector<int> numbers) {
vector<string>res;
for(auto & x : numbers) res.push_back(to_string(x));
for(int i=0;i<res.size();i++){
for(int j=0;j<res.size()-1;j++){
if(res[j] + res[j+1] > res[j+1] + res[j]){
string temp = res[j+1];
res[j+1] = res[j];
res[j] = temp;
}
}
}//假冒泡(复杂版)进行一次字符串比较的排序
string fin;
for(auto &x : res) fin += x;
return fin;
}
};

京公网安备 11010502036488号