poj 1002 字符串

题意:电话拨号有不同的形式,其中的一种映射:

A, B, and C map to 2 

D, E, and F map to 3 
G, H, and I map to 4 
J, K, and L map to 5 
M, N, and O map to 6 
P, R, and S map to 7 
T, U, and V map to 8 
W, X, and Y map to 9 

对于输入的电话号码(形式可能不同),求出是否有相同号码出现.

思路:将给定的号码形式转化为只含7个数字的字符串,(号码只有7位,且输出形式固定),在进行排序.

代码:

#include <iostream> #include <cstdio> #include <cstring> using namespace std; char tel[100059][10]; int dir[] = {2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9}; int cmp(const void *a, const void *b) { return strcmp((char*)a,(char*)b); } void print(char s[],int count) { int i; for(i=0; i<3; i++) printf("%c",s[i]); printf("-"); for(i=3; i<7; i++) printf("%c",s[i]); printf(" %d/n",count); } int main(void) { int n,i,j; bool flag = true; char s[20],num[10]; scanf("%d",&n); for(i=0; i<n; i++) { scanf("%s",s); int len = strlen(s); memset(num,0,sizeof(num)); int k; for(k=0,j=0; j<len; j++) if(dir[s[j]-'A']>0 && dir[s[j]-'A']<=9) num[k++] = dir[s[j]-'A'] + '0'; else if(s[j]>='0' && s[j] <='9') num[k++] = s[j]; for(j=0; j<7; j++) tel[i][j] = num[j]; tel[i][7] = '/0'; memset(s,0,sizeof(s)); } qsort(tel,n,sizeof(char)*10,cmp); int count=1; for(i=1,j=0; i<=n; i++) { if(strcmp(tel[i],tel[j]) == 0) count++; else { if(count>1) { flag = false; print(tel[j],count); count = 1; } j = i; } } if(flag) printf("No duplicates./n"); return 0; }