题目描述:
思路:
代码:
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10010;
int a,b;
char A[N];
char B[N];
int f[N][N];
int main()
{
scanf("%d%s", &a, A + 1);
scanf("%d%s", &b, B + 1);
for (int i = 0; i <= a; i++) {
f[i][0] = i;
}
for (int i = 0; i <= b; i++)
{
f[0][i] = i;
}
for (int i = 1; i <= a; i++)
{
for (int j = 1; j <= b; 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);
}
}
printf("%d", f[a][b]);
return 0;
}