力扣 179. 最大数 C++
代码:
class Solution {
public:
bool cmp(string s1,string s2){
string ss1 = s1,ss2 = s2;
ss1.append(ss2);
s2.append(s1);
return s2 > ss1;
}
void quickSearch(vector<string> &sn,int low,int high){
int i = low,j = high;
string temp = sn[low];
if(i>=j){
return;
} else{
while (i < j){
while (cmp(sn[j],temp) && i < j){
--j;
}
if(i == j){
break;
}
sn[i++] = sn[j];
while (cmp(temp,sn[i]) && i < j){
++i;
}
if(i == j){
break;
}
sn[j--] = sn[i];
}
sn[i] = temp;
quickSearch(sn,low,i-1);
quickSearch(sn,i+1,high);
}
}
string largestNumber(vector<int>& nums) {
string s = "";
int size = nums.size();
int flag = 0;
vector<string> sn(size);
for(int i = 0;i < size;++i){
sn[i] = to_string(nums[i]);
if(nums[i] != 0){
flag = 1;
}
}
if(flag == 0){
return "0";
}
quickSearch(sn,0,size-1);
for(int i = 0;i < size;++i){
s.append(sn[i]);
}
return s;
}
};