-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathEditDistance.java
45 lines (41 loc) · 980 Bytes
/
EditDistance.java
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
import java.util.*;
class EditDistance {
public static int EditDistance(String s, String t) {
if(s.length() == 0 && t.length() == 0) {
return 0;
}
int n = s.length();
int m = t.length();
char[] A = s.toUpperCase().toCharArray();
char[] B = t.toUpperCase().toCharArray();
int[][]D = new int[n+1][m+1];
for(int i=0;i<=n;i++) {
D[i][0] = i;
}
for(int j=0;j<=m;j++) {
D[0][j] = j;
}
for(int j=1;j<=m;j++) {
for(int i=1;i<=n;i++) {
int insertion = D[i][j-1]+1;
int deletion = D[i-1][j]+1;
int min = Math.min(insertion, deletion);
if(A[i-1]==B[j-1]) {
int match = D[i-1][j-1];
min = Math.min(min, match);
}else {
int mismatch = D[i-1][j-1]+1;
min = Math.min(min, mismatch);
}
D[i][j] = min;
}
}
return D[n][m];
}
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
String s = scan.next();
String t = scan.next();
System.out.println(EditDistance(s, t));
}
}