剑指offer 面试题33 把数组排成最小的数

#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>
#include <set>
#include <queue>
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define sca(x) scanf("%d",&x)
#define de printf("=======\n")
typedef long long ll;
using namespace std;

const int g_MaxNumberLength = 10;

char * g_StrCombine1 = new char[2*g_MaxNumberLength+1];
char * g_StrCombine2 = new char[2*g_MaxNumberLength+2];

int compare(const void * strNumber1, const void * strNumber2) {
    strcpy(g_StrCombine1, *(const char **)strNumber1);
    strcat(g_StrCombine1, *(const char **)strNumber2);
    
    strcpy(g_StrCombine2, *(const char **)strNumber2);
    strcat(g_StrCombine2, *(const char **)strNumber1);
    
    return strcmp(g_StrCombine1, g_StrCombine2);
}

void PrintMinNumber(int *numbers, int length) {
    if( numbers == NULL || length <= 0 ) return;
    char **strNumbers = (char **)(new int[length]);
    for( int i = 0; i < length; i++ ) {
        strNumbers[i] = (char *)(new char[g_MaxNumberLength+1] );
        sprintf(strNumbers[i], "%d", numbers[i] );
    }
    qsort(strNumbers, length, sizeof(char *), compare);
    for( int i = 0; i < length; i++ ) {
        printf( "%s", strNumbers[i] );
    }
    printf( "\n" );
    for( int i = 0; i < length; i++ ) {
        delete [] strNumbers[i];
    }
    delete [] strNumbers;
}

int main() {
    int data[4] = {3, 321, 32};
    PrintMinNumber(data, 3);
    return 0;
}