902. 最短编辑距离

https://www.acwing.com/problem/content/submission/code_detail/8885361/

AcWing/902/902.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, m, f[1005][1005];
+string a, b;
+
+int main() {
+    cin >> n >> a >> m >> b;
+    a = ' ' + a;
+    b = ' ' + b;
+    for (int i = 0; i <= n; i++) {
+        f[i][0] = i;
+    }
+    for (int i = 0; i <= m; i++) {
+        f[0][i] = 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;
+}