-
Notifications
You must be signed in to change notification settings - Fork 0
/
5-13(c)-10-28-22.27.c
290 lines (262 loc) · 6.39 KB
/
5-13(c)-10-28-22.27.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
/* 5-13(c)-10-28-22.27.c -- 第五章第十三题 */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define NEITHER 0
#define WORD 1
#define PREFIX 2
#define ROW 4
#define COLS 4
#define NUL '\0'
#define PF '\n'
#define CONSTANT 5
#define TABLESIZE 107
/* 数据类型定义 */
typedef struct cell
{
char * word ;
int word_or_prefix ;
} Cell ;
typedef struct hashtable
{
int size ;
Cell * cell ;
} * HashTable ;
/* ADT声明 */
long int Hash (const char * word, const int size) ;
int InitializeTable (HashTable * const ph, const int size) ;
Cell * Find (const HashTable * const ph, const char * const word) ;
int Insert (const HashTable * const ph, const char * word, const int mode) ;
void Release (const HashTable * const ph) ;
int leaner (const int i) ;
/* 局部函数声明 */
int main (void) ;
char * eat_enter (char * const word) ;
int either_word_or_prefix (const HashTable * const ph, const char * const word) ;
int is_prefix (const HashTable * const ph, const char * const word) ;
int main (void)
{
HashTable h ;
FILE * fp ;
char riddle[ROW][COLS] = {
"this",
"wats",
"oahg",
"fgdt"
} ;
char word[ROW * COLS] ;
int size = TABLESIZE, lenth = ROW * COLS ;
int i, j, i_max, j_max, i_temp, j_temp, w ;
// 将一个词典读入表中
InitializeTable (&h, size) ;
fp = fopen ("word.txt", "r") ;
while (fgets (word, lenth, fp) != NULL)
{
strcpy (word, eat_enter (word)) ;
if (0 == Insert (&h, word, WORD))
puts ("Insert failed") ;
}
fclose (fp) ;
// 将词典中单词的所有前缀读入表中
fp = fopen ("prefix.txt", "r") ;
while (fgets (word, lenth, fp) != NULL)
{
strcpy (word, eat_enter (word)) ;
if (0 == Insert (&h, word, PREFIX))
puts ("Insert failed") ;
}
fclose (fp) ;
// 开始测试
for (i = 0, i_max = ROW; i < i_max; i++)
{
for (j = 0, j_max = COLS; j < j_max; j++)
{
// 左
for (j_temp = j, w = 0; j_temp >= 0; j_temp--, w++)
{
word[w] = riddle[i][j_temp] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 右
for (j_temp = j, w = 0; j_temp < j_max; j_temp++, w++)
{
word[w] = riddle[i][j_temp] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 上
for (i_temp = i, w = 0; i_temp >= 0; i_temp--, w++)
{
word[w] = riddle[i_temp][j] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 下
for (i_temp = i, w = 0; i_temp < i_max; i_temp++, w++)
{
word[w] = riddle[i_temp][j] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 左上
for (i_temp = i, j_temp = j, w = 0; i_temp >= 0 && j_temp >= 0; i_temp--, j_temp--, w++)
{
word[w] = riddle[i_temp][j_temp] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 右上
for (i_temp = i, j_temp = j, w = 0; i_temp >= 0 && j_temp < j_max; i_temp--, j_temp++, w++)
{
word[w] = riddle[i_temp][j_temp] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 左下
for (i_temp = i, j_temp = j, w = 0; i_temp < i_max && j_temp >= 0; i_temp++, j_temp--, w++)
{
word[w] = riddle[i_temp][j_temp] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
// 右下
for (i_temp = i, j_temp = j, w = 0; i_temp < i_max && j_temp < j_max; i_temp++, j_temp++, w++)
{
word[w] = riddle[i_temp][j_temp] ;
word[w + 1] = NUL ;
if (WORD == either_word_or_prefix (&h, word))
printf ("%s\n", word) ;
else if (NEITHER == either_word_or_prefix (&h, word))
break ;
}
}
}
Release (&h) ;
return 0 ;
}
char * eat_enter (char * const word)
{
int count = 0;
while (word[count] != PF)
{
count++ ;
if (NUL == word[count])
return word ;
}
word[count] = NUL ;
return word ;
}
int either_word_or_prefix (const HashTable * const ph, const char * const word)
{
Cell * cell ;
cell = Find (ph, word) ;
if (cell -> word && 0 == strcmp (cell -> word, word))
{
if (WORD == cell -> word_or_prefix)
return WORD ;
else if (PREFIX == cell -> word_or_prefix)
return PREFIX ;
}
return NEITHER ;
}
/* ADT定义 */
long int Hash (const char * word, const int size)
{
long int hash_value = 0 ;
int count ;
for (count = 0; word[count] != PF && word[count] != NUL; count++)
hash_value = (hash_value << CONSTANT) + word[count] ;
return hash_value % size ;
}
int InitializeTable (HashTable * const ph, const int size)
{
int temp ;
*ph = (struct hashtable *) malloc (sizeof (struct hashtable)) ;
if (NULL == *ph)
{
puts ("Out of space.[1]") ;
return 0 ;
}
temp = sizeof (Cell) ;
(*ph) -> cell = (Cell *) calloc (temp, size) ;
if (NULL == (*ph) -> cell)
{
puts ("Out of space.[2]") ;
free (*ph) ;
return 0 ;
}
(*ph) -> size = size ;
return 1 ;
}
Cell * Find (const HashTable * const ph, const char * const word)
{
long int hash_value ;
int size, i, index ;
size = (*ph) -> size ;
i = 0 ;
do
{
hash_value = Hash (word, size) ;
index = (hash_value + leaner (i++)) % size ;
}
/* 数据域不为空并且字符串不相同 */
while ((*ph) -> cell[index].word != NULL && strcmp (word, (*ph) -> cell[index].word) != 0)
;
return (*ph) -> cell + index ;
}
int Insert (const HashTable * const ph, const char * word, const int mode)
{
Cell * cell ;
int size = (*ph) -> size ;
// 不添加换行符
if (PF == *word)
return 0 ;
cell = Find (ph, word) ;
if (NULL == cell -> word)
{
cell -> word = (char *) malloc (sizeof (char)) ;
if (NULL == cell -> word)
{
puts ("out of space.[4]") ;
return 0 ;
}
strcpy (cell -> word, word) ;
cell -> word_or_prefix = mode ;
return 1 ;
}
/* 不重复添加 */
else if (0 == strcmp (cell -> word, word))
return 1 ;
return 0 ;
}
void Release (const HashTable * const ph)
{
free ((*ph) -> cell) ;
free (*ph) ;
}
int leaner (const int i)
{
return i ;
}