PTA数据结构与算法题目集(中文) 7-14

  1 #define _CRT_SECURE_NO_WARNINGS   
  2 #include<stdio.h>
  3 #include<stdlib.h>
  4 #include<malloc.h>
  5 #include<math.h>
  6 #include<string.h>
  7 #define KEYLENGTH 11
  8 #define MAXTABLESIZE 10000
  9 
 10 typedef char ElementType[KEYLENGTH + 1];
 11 typedef struct LNode* PtrToLNode;
 12 typedef PtrToLNode List;
 13 struct  LNode
 14 {
 15     ElementType Data;
 16     PtrToLNode Next;
 17     int TelTimes;
 18 };
 19 
 20 typedef struct HblNode* HashTable;
 21 struct HblNode
 22 {
 23     int TableSize;
 24     List Heads;
 25 };
 26 
 27 long Atoi(ElementType Tel)
 28 {
 29     long num = 0;
 30     int length = strlen(Tel);
 31     for (int i = 0; i < length; i++)
 32         num += num * 10 + Tel[i] - ‘0‘;
 33     return num;
 34 }
 35 
 36 int NextPrime(int num)
 37 {
 38     int p = (num % 2) ? num + 2 : num + 1;
 39     int i;
 40     while (p<MAXTABLESIZE)
 41     {
 42         for (i = (int)sqrt(p); i > 2; i--)
 43             if (p % i == 0)
 44                 break;
 45         if (i == 2)
 46             break;
 47         else
 48             p += 2;
 49     }
 50     return p;
 51 }
 52 
 53 int Hash(ElementType Tel,int TabelSize)
 54 {
 55     return atoi(Tel+5) % TabelSize;
 56 }
 57 
 58 HashTable BuildHashTable(int TabelSize)
 59 {
 60     HashTable H = (HashTable)malloc(sizeof(struct HblNode));
 61     H->TableSize = NextPrime(TabelSize);
 62     H->Heads = (List)malloc(H->TableSize * sizeof(struct LNode));
 63     for (int i = 0; i < H->TableSize; i++)
 64     {
 65         H->Heads[i].Data[0] = ‘\0‘;
 66         H->Heads[i].Next = NULL;
 67     }
 68     return H;
 69 }
 70 
 71 PtrToLNode Find(ElementType Tel, HashTable H)
 72 {
 73     int i = Hash(Tel,H->TableSize);
 74     PtrToLNode P = H->Heads[i].Next;
 75     while (P && strcmp(P->Data, Tel))
 76         P = P->Next;
 77     return P;
 78 }
 79 
 80 void Insert(ElementType Tel, HashTable H)
 81 {
 82     PtrToLNode P, NewCell;
 83     P = Find(Tel, H);
 84     if (!P)
 85     {
 86         int i = Hash(Tel, H->TableSize);
 87         NewCell = (PtrToLNode)malloc(sizeof(struct LNode));
 88         strcpy(NewCell->Data, Tel);
 89         NewCell->TelTimes = 1;
 90         NewCell->Next = H->Heads[i].Next;
 91         H->Heads[i].Next = NewCell;
 92     }
 93     else
 94         P->TelTimes++;
 95 }
 96 
 97 HashTable CreateHashTable()
 98 {
 99     int N;
100     scanf("%d", &N);
101     HashTable H = BuildHashTable(N);
102     N *= 2;
103     while (N--)
104     {
105         ElementType Tel;
106         scanf("%s", Tel);
107         Insert(Tel, H);
108     }
109     return H;
110 }
111 void Judge(HashTable H)
112 {
113     int TelTimes = -1;
114     PtrToLNode MinP=NULL;
115     PtrToLNode P=NULL;
116     int Persons = 0;
117     for (int i = 0; i < H->TableSize; i++)
118     {
119         P = H->Heads[i].Next;
120         while (P)
121         {
122             if (P->TelTimes > TelTimes)
123             {
124                 Persons = 1;
125                 MinP = P;
126                 TelTimes = P->TelTimes;
127             }
128             else if (P->TelTimes == TelTimes)
129                 Persons++;
130             P = P->Next;
131         }
132     }
133     if(Persons==1)
134         printf("%s %d", MinP->Data,MinP->TelTimes);
135     else
136         printf("%s %d %d", MinP->Data, MinP->TelTimes,Persons);
137 }
138 
139 int main()
140 {
141     HashTable H = CreateHashTable();
142     Judge(H);
143     return 0;
144 }