关于题目的具体介绍:
A和B是两个字符串,用最少的字符操作将A转换为B,操作包括:
删除1个字符、
插入1个字符、
替换1个字符。
可参考:
【动态规划】最小编辑距离(字符串A到字符串B变化最少要多少步)】
https://blog.csdn.net/ma2413419/article/details/82693319/?utm_medium=distribute.pc_relevant.none-task-blog-title-2&spm=1001.2101.3001.4242
其相关C++编程,可参考:
【动态规划求解-将字符串A变换为字符串B 所用的最少字符操作次数】
https://blog.csdn.net/qq_41823255/article/details/102635069?utm_medium=distribute.pc_relevant.none-task-blog-title-2&spm=1001.2101.3001.4242
以下是本人对题目的编程求解:
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
#define N 30
int MinEditDistance(char A[], char B[], int len_A, int len_B){
//int D[len_A + 1][len_B + 1];//实际定义的数组,但是在C++中,只能使用常量定义一个数组,所以改为定义一个较大的数组
int D[N][N];
D[0][0] = 0;
for (int i = 1; i <=len_A; i++){
D[0][i] = i;
}
for (int i = 1; i <=len_B; i++){
D[i][0] = i;
}
for (int i = 1; i <= len_B; i++){
for (int j = 1; j <= len_A; j++){
int zuo = D[i][j - 1] + 1;
int shang = D[i - 1][j] + 1;
int equal = 0;
if (A[j - 1] != B[i - 1]){
equal = 1;
}
int zuoshang = D[i - 1][j - 1] + equal;
D[i][j] =min(min(zuo, shang), zuoshang);
//D[i][j] = min(min(D[i - 1][j] + 1, D[i][j - 1] + 1), (A[j - 1] == B[i - 1] ? D[i - 1][j - 1] : D[i - 1][j - 1] + 1));
}
}
return D[len_B][len_A];
}
int main(){
char a[100];
char b[100];
gets(a);//获取字符串数组
gets(b);
int len_a = strlen(a);
int len_b = strlen(b);
cout << MinEditDistance(a, b, len_a, len_b) << endl;
system("pause");
return 0;
}
其中:
添加:dis[i][j] = 1 + dis[i][j-1];
删除:dis[i][j] = 1 + dis[i-1][j]
替换:dis[i][j] = 1 + dis[i-1][j-1];
若两字符相同,则:dis[i][j] = dis[i-1][j-1]
运行结果如图: