Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.
Input Specification:
Each input file contains one test case. Each case gives a positive integer N (<=10000) followed by N number segments. Each segment contains a non-negative integer of no more than 8 digits. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the smallest number in one line. Do not output leading zeros.
Sample Input:5 32 321 3214 0229 87Sample Output:
22932132143287
——————————
简单题目,
在leetcode上面见过类似的题目,leetcode上面为找到最大的数,这个题目类似
之所以没有一步正确,主要是因为自己没有考虑到前面几个均为0.
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int N;
bool cmp(string s1, string s2){
return (s1+s2)<(s2+s1);
}
int main(int argc, char** argv) {
vector<string> v;
string ans;
int i=0;
scanf("%d",&N);
for(i=0; i<N; i++){
string tmp;
cin>>tmp;
v.push_back(tmp);
}
sort(v.begin(),v.end(),cmp);
for(i=0; i<v.size(); i++) ans=ans+v[i];//左加
bool flag=false;
for(i=0; i<ans.size(); i++){
if(ans[i]=='0'&&!flag){
if(i==ans.size()-1){
printf("0");
}
continue;
}else{
cout<<ans[i];
flag=true;
}
}
return 0;
}