AcWing 902. 最短编辑距离
原题链接
简单
作者:
yokeriz
,
2024-04-23 19:40:40
,
所有人可见
,
阅读 6
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1e3 + 10;
int n, m;
char a[N], b[N];
int dp[N][N];
int main()
{
scanf("%d%s", &m, a + 1);
scanf("%d%s", &n, b + 1);
for(int i = 0; i <= m; i ++ ) dp[i][0] = i;
for(int j = 0; j <= n; j ++ ) dp[0][j] = j;
for(int i = 1; i <= m; i ++ )
for(int j = 1; j <= n; j ++ )
{
dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + (a[i] != b[j]));
}
printf("%d\n", dp[m][n]);
return 0;
}