这个题是最短编辑距离的一个小应用,直接套进去就可以了。
需要注意的是原本每次计算时都重新new了一个f[][] 发现爆内存,是因为每次虚拟机都会创建新的一个二维数组,但是f仅仅指向一个地址。
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(System.out);
static int N = 1010, n, m;
static int f[][] = new int[N][N];
static char[] a, b;
public static void main(String[] args) throws IOException {
String[] s = br.readLine().split(" ");
n = Integer.parseInt(s[0]);
m = Integer.parseInt(s[1]);
String[] opreation = new String[n + 5];
for (int i = 0; i < n; i++) opreation[i] = br.readLine();
for (int i = 0; i < m; i++) {
int res = 0;
s = br.readLine().split(" ");
String changed = s[0];
int times = Integer.parseInt(s[1]);
for (int j = 0; j < n; j++) {
a = opreation[j].toCharArray();
b = changed.toCharArray();
if (edit(a, b) <= times) res++;
}
pw.println(res);
System.gc();
}
pw.flush();
pw.close();
br.close();
}
public static int edit(char[] a, char[] b) {
for (int i = 0; i <= a.length; i++) f[i][0] = i;
for (int i = 0; i <= b.length; i++) f[0][i] = i;
for (int k = 1; k <= a.length; k++) {
for (int l = 1; l <= b.length; l++) {
f[k][l] = Math.min(f[k - 1][l] + 1, f[k][l - 1] + 1);
if (a[k - 1] == b[l - 1]) f[k][l] = Math.min(f[k][l], f[k - 1][l - 1]);
else f[k][l] = Math.min(f[k][l], f[k - 1][l - 1] + 1);
}
}
return f[a.length][b.length];
}
}