31 lines
738 B
C++
31 lines
738 B
C++
#include <bits/stdc++.h>
|
|
|
|
using namespace std;
|
|
|
|
const int N = 1010;
|
|
int n, m;
|
|
char a[N], b[N];
|
|
int f[N][N];
|
|
|
|
// 最短编辑距离
|
|
int main() {
|
|
cin >> n >> a + 1 >> m >> b + 1;
|
|
|
|
// 初始化
|
|
for (int i = 0; i <= m; i++) f[0][i] = i;
|
|
for (int i = 0; i <= n; i++) f[i][0] = 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);
|
|
}
|
|
|
|
cout << f[n][m] << endl;
|
|
return 0;
|
|
} |