- Notifications
You must be signed in to change notification settings - Fork 117
/
Copy path72.c
53 lines (46 loc) · 1.69 KB
/
72.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
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
intmin(inta, intb, intc) {
intmin=a;
if (b<min) min=b;
if (c<min) min=c;
returnmin;
}
intminDistance(char*word1, char*word2) {
intlen1=strlen(word1);
intlen2=strlen(word2);
/* these two lines can be commented out */
if (len1==0) returnlen2;
if (len2==0) returnlen1;
int(*d)[len2+1] = (int (*)[len2+1])calloc((len1+1) * (len2+1), sizeof(int));
inti, j;
d[0][0] =0; /* dummy */
for (i=1; i <= len1; i++) d[i][0] =i;
for (j=1; j <= len2; j++) d[0][j] =j;
for (i=1; i <= len1; i++){
for (j=1; j <= len2; j++) {
/* d[i][j] represents distance of word1[0..i-1] and word2[0..j-1] */
if (word1[i-1] ==word2[j-1]) {
d[i][j] =d[i-1][j-1];
}
else {
d[i][j] =min(
d[i][j-1] +1, /* insert a character(word2[j-1]) to the tail of word1[0..i-1] */
d[i-1][j] +1, /* delete a character(word1[i-1]) from the tail of word1[0..i-1] */
d[i-1][j-1] +1/* replace a character in tail of word1[0..i-1] */
);
}
}
}
returnd[len1][len2];
}
intmain() {
printf("%d %d\n", minDistance("word", "wood"), 1);
printf("%d %d\n", minDistance("word", "woord"), 1);
printf("%d %d\n", minDistance("d", "word"), 3);
printf("%d %d\n", minDistance("", "word"), 4);
printf("%d %d\n", minDistance("abcd", "word"), 3);
printf("%d %d\n", minDistance("ffff", "word"), 4);
return0;
}