百炼OJ 2974 *的标准化

问题：将一连串的字符转化成用数字表示的数字串 ，如：

3234567       -----   323-4567

888-GINO      -----  888-1010

3-10-10-10    -----  310-1010

-8-2-3-5-7-2-9- --  823-5729

该问题的关键点在于去 ‘-’ 和 将对应的字符映射到数字，见代码：

/************************************************************************/
 *        Author: bakari  
 *        Date :2012/6/5
 *        StandardPhoneNum
/************************************************************************/
#include <iostream>
#include <string.h>
#include <algorithm>
using std::cout;
using std::cin;
using std::endl;

const int STRLEN = 9;
const int MAXSTRLEN = 50;
const int MAXROW = 10000;

char map[] = "22233344455566677778889999";  //存储映射表
char TranseStr[MAXROW][STRLEN];
//char str[MAXSTRLEN];

int cmp (const void * elem1, const void * elem2){  //快排比较函数
    return strcmp((char *)elem1, (char *)elem2); 

}
void StandardTranse(const char *str, int n){

    for(size_t i = 0, j = 0; j < STRLEN - 1; ){
        if(str[i] != '-'){
            if(str[i] <= 'Z' && str[i] >= 'A')
                TranseStr[n][j] = map[str[i] - 'A'];
            if(str[i] <= '9' && str[i] >= '0')
                TranseStr[n][j] = str[i];
            ++ i;
            ++ j;
        }
        else{
            ++ i;
        }
        if(3 == j){
            TranseStr[n][j++] = '-';
        }
    }
}

void FindSameNum(int n){
    int ix = 0;
    int jx;
    bool noduplicate = true;
    while(ix < n){
        jx = ix;
        ++ ix;
        while(ix < n && strcmp(TranseStr[ix],TranseStr[jx]) == 0)
            ++ix;
        if (ix - jx > 1){
            cout << TranseStr[jx] << " " << ix - jx <<endl;
            noduplicate = false;
        }
    }
    if (noduplicate)
        cout << "No duplicate." << endl;
}

int main()
{
    int n;
    char str[MAXSTRLEN];
    cin >> n;
    for(int i = 0; i != n; ++i){
        cin >> str;
        StandardTranse(i);
    }
     cout << "输出" <<endl;
    for(int i = 0; i != n; ++i)
         cout << TranseStr[i] << endl;
    
    qsort(TranseStr,n,STRLEN,cmp);
    FindSameNum(n);
    return 0;
}

标准化函数StandardTranse()的另一个解法

void StandardTranse(const char *str, int n){
    int j ,k;
    j = k = -1;
    while(k < STRLEN - 1){
        j ++;
        if(str[j] == '-')   //先做判断
            continue;
        k ++;
        if(3 == k)
            TranseStr[n][k ++] = '-';
        if(str[j] >= 'A' && str[j] <= 'Z'){
            TranseStr[n][k] = map[str[j] - 'A'];
            continue;
        }
        TranseStr[n][k] = str[j];
    }
    TranseStr[n][k] = '\0';
}