AcWing 899. 编辑距离
原题链接
简单
作者:
zsfzmxl
,
2023-11-16 20:08:44
,
所有人可见
,
阅读 80
喜欢的赞一下
C++ 代码
#include<bits/stdc++.h>
using namespace std;
const int N = 15, M = 1010;
int n, m;
int f[N][N];
char str[M][N];
int edit_distance(char a[], char b[]){
int la = strlen(a + 1), lb = strlen(b + 1);
for (int i = 0; i <= lb; i ++ ) f[0][i] = i;
for (int i = 0; i <= la; i ++ ) f[i][0] = i;
for (int i = 1; i <= la; i ++ )
for (int j = 1; j <= lb; j ++ ){
f[i][j] = min(f[i - 1][j] + 1, f[i][j - 1] + 1);
f[i][j] = min(f[i][j], f[i - 1][j - 1] + (a[i] != b[j]));
}
return f[la][lb];
}
int main(){
cin>>n>>m;
for (int i = 0; i < n; i ++ ) scanf("%s", str[i] + 1);
while (m -- ){
char s[N];
int limit;
scanf("%s%d", s + 1, &limit);
int res = 0;
for (int i = 0; i < n; i ++ )
if (edit_distance(str[i], s) <= limit)
res ++ ;
cout<<res<<endl;
}
return 0;
}