我试图使用维基百科参考在java中
用Java实现的Wagner-Fischer algorithm
瓦格纳菲舍尔算法实现
Java代码:
public class StringDistance {
public static void main(String[] args) {
int i, j, m, n, temp, tracker;
int[][] d = new int[50][50];
String s = "kitten";
String t = "sitting";
char u[] = s.toCharArray();
char v[] = t.toCharArray();
m = u.length;
n = v.length;
for (i = 0; i <= m; i++) {
d[i][0] = i;
}
for (j = 0; j <= n; j++) {
d[0][j] = j;
}
for (j = 1; j <= m; j++) {
for (i = 1; i <= n; i++) {
if (u[i - 1] == v[j - 1]) {
tracker = 0;
} else {
tracker = 1;
}
temp = Math.min((d[i - 1][j] + 1), (d[i][j - 1] + 1));
d[i][j] = Math.min(temp, (d[i - 1][j - 1] + tracker));
}
}
System.out.println("The levenstien distance" + d[n][m]);
}
}
但上面的代码为唯一的工作等长的琴弦。如果我想让这个工作不平等strings.Please让我知道如何克服这个问题。
我收到索引越界的错误:
Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: 6
at StringDistance.main(StringDistance.java:32)