1038. Recover the Smallest Number (30)

在比较两个字符串大小的时候，直接将字符串连接起来比较即可。

#define  _CRT_SECURE_NO_WARNINGS 

#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream> 
#include<algorithm>
#include<stdio.h> 
using namespace std;
struct Number
{
char num[9];
};
bool cmp(Number a, Number b)
{ 
string s1(a.num), s2(b.num);
s1 += b.num;
s2 += a.num;
return s1 < s2;
//int i = 0;
//for (; a.num[i] && b.num[i]; i++)
//{
// if (a.num[i] != b.num[i])
// return a.num[i] < b.num[i];
//}
//if (a.num[i])
// return a.num[i] < b.num[0];
//if (b.num[i])
// return a.num[0] < b.num[i];
//return false;
}
bool EqlZero(char *a)
{ 
for (int i = 0; a[i]; i++)
{
if (a[i] != '0')
return false;
}
return true;
}
int main()
{ 
int N;
cin >> N;
Number *num = new Number[N];
for (int i = 0; i < N; i++)
scanf("%s",num[i].num);


sort(num,num+N,cmp);
int i = 0;
while (EqlZero(num[i].num) && i<N)
{
i++;
} 
if (i < N)
{
int j = 0;
while (num[i].num[j])
if (num[i].num[j] == '0')
j++;
else
break;
while (num[i].num[j])
{
printf("%c", num[i].num[j]);
j++;
}
for (i =i+1; i < N; i++)
printf("%s", num[i].num);
}
else
cout << "0\n"; 
return 0;
}