题意:
给定长度n,m的字符串A,B,有3种操作(略),问字符串A变成B最少操作次数 (n, m<= 1000).
思路:
dp[i][j] 表示的是 s 1..i 变为 t 1…j 所需要的最少操作:
故可分为三种情况讨论:
1.删除s最,后一个字符:显然上一状态为 s1…i-1 == t1…j
2.s后添加一个字符:同理上一状态为 s1…i == t1…j-1
3.修改S最后一个字符:上一状态 s1…i-1 == t1…j-1,这种情况下显然若Si == Tj,则可以简化,即
不小号操作次数.
代码实现:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 2010;
int dp[N][N];
char s[N], t[N];
int main () {
int n, m;
scanf("%d %s", & n, s + 1);
scanf("%d %s", & m, t + 1);
dp[0][0] = 0;
for (int i = 1; i <= m; i ++ ) dp[0][i] = i;
for (int i = 1; i <= n; i ++ ) dp[i][0] = i;
for (int i = 1; i <= n; i ++ ) {
for (int j = 1; j <= m; j ++ ) {
dp[i][j] = min (dp[i][j - 1], dp[i - 1][j]) + 1;
if (s[i] != t[j]) dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + 1);
else dp[i][j] = min (dp[i][j], dp[i - 1][j - 1]);
}
}
cout << dp[n][m] << endl;
return 0;
}
THE END;