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
|
struct Node;
struct LinkList;
typedef struct Node *PNode;
typedef struct LinkList *PLinkList;
struct Node {
char word[20];
PNode link;
};
struct LinkList {
PNode head;
};
PLinkList dictionary = NULL;
int compare(char *a, char *b);
char *remove(char *word, int i);
char *change(char *word, char a, int i);
PLinkList selectSimWords(char *word);
PLinkList findCorrectWords(PLinkList simwords, char *word);
void printCorrectWords(PLinkList correctwords, char *word);
int main() {
dictionary = (PLinkList)malloc(sizeof(LinkList));
if (dictionary == NULL)
printf("err!");
dictionary->head = NULL;
PNode p1 = NULL, pr1 = NULL;
while (1) {
p1 = (PNode)malloc(sizeof(Node));
if (p1 == NULL)
printf("err!");
scanf("%s", p1->word);
if (strcmp(p1->word, "#") == 0)
break;
if (dictionary->head == NULL)
dictionary->head = p1;
else
pr1->link = p1;
pr1 = p1;
}
pr1->link = NULL;
PLinkList sample = NULL;
sample = (PLinkList)malloc(sizeof(LinkList));
if (sample == NULL)
printf("err!");
sample->head = NULL;
PNode p2 = NULL, pr2 = NULL;
while (1) {
p2 = (PNode)malloc(sizeof(Node));
if (p2 == NULL)
printf("err!");
scanf("%s", p2->word);
if (strcmp(p2->word, "#") == 0)
break;
if (sample->head == NULL)
sample->head = p2;
else
pr2->link = p2;
pr2 = p2;
}
pr2->link = NULL;
PNode p3 = sample->head;
while (p3 != NULL) {
if (p3 != sample->head)
printf("\n");
printCorrectWords(findCorrectWords(selectSimWords(p3->word), p3->word), p3->word);
p3 = p3->link;
}
return 0;
}
int compare(char *a, char *b) {
int i = 0, k = strlen(b);
while (b[i] != '\0') {
if (a[i] != b[i]) {
k = i;
break;
}
i++;
}
return k;
}
char *remove(char *word, int i) {
static char newword[20];
int j = 0;
while (j < i) {
newword[j] = word[j];
j++;
}
while (word[j + 1] != '\0') {
newword[j] = word[j + 1];
j++;
}
newword[j] = '\0';
return newword;
}
char *change(char *word, char a, int i) {
static char newword[20];
int j = 0;
while (j < i) {
newword[j] = word[j];
j++;
}
newword[j] = a;
j++;
while (word[j] != '\0') {
newword[j] = word[j];
j++;
}
newword[j] = '\0';
return newword;
}
PLinkList selectSimWords(char *word) {
int l = strlen(word), lw;
PLinkList simwords = NULL;
simwords = (PLinkList)malloc(sizeof(LinkList));
if (simwords == NULL)
printf("err!");
simwords->head = NULL;
PNode p = dictionary->head, p2 = NULL, pr2 = NULL;
while (p != NULL) {
p2 = (PNode)malloc(sizeof(Node));
if (p2 == NULL)
printf("err!");
lw = strlen(p->word);
if (lw - l >= -1 && lw - l <= 1) {
;
strcpy(p2->word, p->word);
if (simwords->head == NULL)
simwords->head = p2;
else
pr2->link = p2;
pr2 = p2;
}
p = p->link;
}
pr2->link = NULL;
return simwords;
}
PLinkList findCorrectWords(PLinkList simwords, char *word) {
PLinkList correctwords = NULL;
correctwords = (PLinkList)malloc(sizeof(LinkList));
if (correctwords == NULL)
printf("err!");
correctwords->head = NULL;
PNode p = simwords->head, p2 = NULL, pr2 = NULL;
int deltal, index;
while (p != NULL) {
deltal = strlen(p->word) - strlen(word);
if (deltal == 1) {
char changedword[20];
index = compare(p->word, word);
strcpy(changedword, remove(p->word, index));
if (strcmp(changedword, word) == 0) {
p2 = (PNode)malloc(sizeof(Node));
if (p2 == NULL)
printf("err!");
strcpy(p2->word, p->word);
if (correctwords->head == NULL)
correctwords->head = p2;
else
pr2->link = p2;
pr2 = p2;
}
} else if (deltal == -1) {
char changedword[20];
index = compare(word, p->word);
strcpy(changedword, remove(word, index));
if (strcmp(changedword, p->word) == 0) {
p2 = (PNode)malloc(sizeof(Node));
if (p2 == NULL)
printf("err!");
strcpy(p2->word, p->word);
if (correctwords->head == NULL)
correctwords->head = p2;
else
pr2->link = p2;
pr2 = p2;
}
} else if (deltal == 0) {
if (strcmp(p->word, word) == 0) {
correctwords->head = (PNode)malloc(sizeof(Node));
strcpy(correctwords->head->word, word);
correctwords->head->link = NULL;
return correctwords;
} else {
char changedword[20];
index = compare(p->word, word);
strcpy(changedword, change(word, p->word[index], index));
if (strcmp(changedword, p->word) == 0) {
p2 = (PNode)malloc(sizeof(Node));
if (p2 == NULL)
printf("err!");
strcpy(p2->word, p->word);
if (correctwords->head == NULL)
correctwords->head = p2;
else
pr2->link = p2;
pr2 = p2;
}
}
}
p = p->link;
}
if (pr2 != NULL)
pr2->link = NULL;
return correctwords;
}
void printCorrectWords(PLinkList correctwords, char *word) {
PNode p = correctwords->head;
if (p == NULL)
printf("%s:", word);
else if (strcmp(p->word, word) == 0)
printf("%s is correct", word);
else {
printf("%s:", word);
while (p != NULL) {
printf(" %s", p->word);
p = p->link;
}
}
}
|
