AcWing 899. 编辑距离
原题链接
简单
作者:
半醒的狐狸
,
2022-06-04 03:06:06
,
所有人可见
,
阅读 284
String写法
#include <iostream>
#include <vector>
#include <cstring>
using namespace std;
const int N = 1010, M = 15;
int n, m;
vector<string> str(N);
int f[N][N];
int match(string a, string b) {
int la = a.size(), lb = b.size();
for (int i = 0; i <= la; i ++ ) f[i][0] = i;
for (int i = 0; i <= lb; i ++ ) f[0][i] = i;
for (int i = 1; i <= la; i ++ )
for (int j = 1; j <= lb; j ++ ) {
f[i][j] = min(f[i - 1][j], f[i][j - 1]) + 1;
int t = (a[i] != b[j]);
f[i][j] = min(f[i][j], f[i - 1][j - 1] + t);
}
return f[la][lb];
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i ++ ) {
cin >> str[i];
str[i] = ' ' + str[i];
}
while (m -- ) {
string s;
int limit;
cin >> s >> limit;
s = ' ' + s;
int cnt = 0;
for (int i = 0; i < n; i ++ )
if (match(str[i], s) <= limit)
cnt ++ ;
cout << cnt << endl;
}
return 0;
}