数据结构练习（30）把数组排成最小的数

#include <cstdio>
#include <cstring>
#include <cstdlib>

const int MAXN = 10;

int mycompare(const void* s1, const void* s2)
{
char combine1[MAXN+1], combine2[MAXN+1];

strcpy(combine1, *(const char**)s1);
strcat(combine1, *(const char**)s2);

strcpy(combine2, *(const char**)s2);
strcat(combine2, *(const char**)s1);

return strcmp(combine1, combine2);
}

void PrintMinNumber(int n[], int len)
{
if (n == nullptr || len <= 0)
return ;

char** szn = (char**)(new int[len]);
for (int i = 0; i < len; ++i)
{
szn[i] = new char[MAXN];
sprintf(szn[i], "%d", n[i]);
}
qsort(szn, len, sizeof(char*), mycompare);

for (int i = 0; i < len; ++i)
printf("%s", szn[i]);
printf("\n");

for (int i = 0; i < len; ++i)
delete[] szn[i];
delete[] szn;
}

int main()
{
int n[10] = {32, 321};
PrintMinNumber(n, 2);
return 0;
}