这道题目第一反应是用哈希,然后觉得用排序也可以,先后想到快速排序,堆排序,二叉排序树。我的第一次解答用的哈希做的,字符序列转换成整数序列。开了一个10000000的大数组,因此空间用的多,遍历数组的时间也多了,不过过了。哈希的缺点在于最后统计时从前到后遍历大数组找重复的很花时间。
题目:
487-3279
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 72542 | Accepted: 12000 |
Description
Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens'' number 3-10-10-10. The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows: 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 There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010. Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.) Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number.
Input
The input will consist of one case. The first line of the input specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters.
Output
Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line: No duplicates.
Sample Input
12 4873279 ITS-EASY 888-4567 3-10-10-10 888-GLOP TUT-GLOP 967-11-11 310-GINO F101010 888-1200 -4-8-7-3-2-7-9- 487-3279
Sample Output
310-1010 2 487-3279 4 888-4567 3
源代码:
#include <stdio.h>#define MAXN 100000#define MAXM 7#define MAXHASHVALUE 10000000static unsigned int hashTable[MAXHASHVALUE];static char mapValue[]={'2','2','2','3','3','3','4','4','4','5','5','5','6','6','6','7','7','7','8','8','8','9','9','9'};static int interpret(char c){ char val = c;if(c>='A'&&c<='P')val = mapValue[c-'A'];if(c>='R'&&c<='Y')val = mapValue[c-1-'A'];return val - '0';}static void out(int k){int p = k / 10000;int q = k - p * 10000;printf("%d",p/100);p%=100;printf("%d",p/10);p%=10;printf("%d",p);printf("-");printf("%d",q/1000);q%=1000;printf("%d",q/100);q%=100;printf("%d",q/10);q%=10;printf("%d",q);printf(" ");printf("%d",hashTable[k]);printf("/n");}int main(int argc,char **argv){int n;scanf("%d/n",&n);bool duplicate = false;for(int i=0;i<n;i++){int num = 0;while(true){char c;scanf("%c",&c);if(c=='/n')break;if(c != '-')num = num *10 + interpret(c);}hashTable[num]++;if(hashTable[num]>1){duplicate = true;}}if(!duplicate){printf("No duplicates./n");}else{for(int m=0;m<MAXHASHVALUE;m++){if(hashTable[m] > 1)out(m);}}return 0;}
然后用二叉排序树写了一个,这个当初由于的原因在于如果输入序列本身就有序那么插入的时间复杂度会达到O(n^2),那么肯定过不了。必须采用AVL树或者红黑树来取代。但是时间关系就只是写了个二叉排序树的。
源代码:
#include <stdio.h>
#define MAXN 100000
#define MAXM 7
#define MAXHASHVALUE 10000000
struct bstNode
{
int val;
int cnt;
int left;
int right;
};
#define NIL 0
#define ROOT 1
static bstNode T[MAXN+1];
static int root = NIL;
static int nodeIndex = ROOT;
static bool duplicate = false;
static void insert(int val)
{
int pre = root;
int f = NIL;
bool found = false;
while(pre != NIL && !found)
{
if(T[pre].val == val)
{
T[pre].cnt++;
found = true;
}
else if(T[pre].val > val)
{
f = pre;
pre = T[pre].left;
}
else
{
f = pre;
pre = T[pre].right;
}
}
if(found)
{
duplicate = true;
return;
}
if(f == NIL)
{
root = ROOT;
T[root].val = val;
T[root].cnt++;
T[root].left = T[root].right = NIL;
}
else
{
nodeIndex++;
T[nodeIndex].val = val;
T[nodeIndex].cnt++;
T[nodeIndex].left = T[nodeIndex].right = NIL;
if(T[f].val > val)
{
T[f].left = nodeIndex;
}
else
{
T[f].right = nodeIndex;
}
}
}
static void midOrder(int root,void (*f)(int,int))
{
if(root != NIL)
{
midOrder(T[root].left,f);
if(T[root].cnt > 1)
f(T[root].val,T[root].cnt);
midOrder(T[root].right,f);
}
}
static char mapValue[]={'2','2','2','3','3','3','4','4','4','5','5','5','6','6','6','7','7','7','8','8','8','9','9','9'};
static int interpret(char c)
{
char val = c;
if(c>='A'&&c<='P')
val = mapValue[c-'A'];
if(c>='R'&&c<='Y')
val = mapValue[c-1-'A'];
return val - '0';
}
static void out(int k, int cnt)
{
int p = k / 10000;
int q = k - p * 10000;
printf("%d",p/100);
p%=100;
printf("%d",p/10);
p%=10;
printf("%d",p);
printf("-");
printf("%d",q/1000);
q%=1000;
printf("%d",q/100);
q%=100;
printf("%d",q/10);
q%=10;
printf("%d",q);
printf(" ");
printf("%d",cnt);
printf("/n");
}
int main(int argc,char **argv)
{
int n;
scanf("%d/n",&n);
for(int i=0;i<n;i++)
{
int num = 0;
while(true)
{
char c;
scanf("%c",&c);
if(c=='/n')break;
if(c != '-')
num = num *10 + interpret(c);
}
insert(num);
}
if(!duplicate)
{
printf("No duplicates./n");
}
else
{
midOrder(root,out);
}
return 0;
}