AcWing 899. 编辑距离
原题链接
简单
作者:
我要出去乱说
,
2021-01-28 22:10:45
,
所有人可见
,
阅读 352
#include <iostream>
#include <algorithm>
#include <cstring>
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 n = strlen(a + 1), m = strlen(b + 1); //计算每对字符a, b的长度
for (int i = 0; i <= n; i ++ ) f[i][0] = i;
for (int i = 0; i <= m; i ++ ) f[0][i] = i;
for (int i = 1; i <= n; i ++ )
for (int j = 1; j <= m; j ++ )
{
f[i][j] = min(f[i-1][j] + 1, f[i][j-1] + 1);
if (a[i] == b[j]) f[i][j] = min(f[i][j], f[i-1][j-1]);
else f[i][j] = min(f[i][j], f[i-1][j-1] + 1);
//后两步可简化为一步
//f[i][j] = min(f[i][j], f[i-1][j-1]) + (a[i] != b[j]);
}
return f[n][m];
}
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> str[i] + 1;
while (m -- )
{
char s[N];
int limit;
cin >> s + 1 >> limit;
int res = 0;
for (int i = 0; i < n; i ++ )
if (edit_distance(str[i], s) <= limit) //将每个字符与新字符比较
res ++ ;
cout << res << endl;
}
}