题目是acwing基础算法动态规划中899.编辑距离
题目如下:
我的代码是
#include<stdio.h>
#include<string.h>
int n, m;
const int N = 15, M = 1010;
int f[N][N];
char t[M][N];
int min(int a, int b)
{
if(a <= b) return a;
else return b;
}
int lon(char a[],char b[])
{
int la = strlen(a + 1), lb = strlen(b + 1);
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] + 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);
}
return f[la][lb];
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i <= n; i ++ ) scanf("%s", t[i] + 1);
while(m --)
{
char B[M];
int lim;
int res = 0;
scanf("%s%d", B + 1, &lim);
for(int i = 0; i <= n; i ++)
if (lon(t[i], B) <= lim) res++;
printf("%d\n", res);
}
return 0;
}
感觉和y总视频里讲的一样,但是输出结果是0,4
下面是y总的代码
#include <iostream>
#include <algorithm>
#include <string.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()
{
scanf("%d%d", &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 ++ ;
printf("%d\n", res);
}
return 0;
}
作者:yxc
链接:https://www.acwing.com/activity/content/code/content/62479/
来源:AcWing
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。
帮忙找找我的错误谢谢大家