51nod1183 编辑距离

原题链接：https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1183

思路：很类似于LCS，不过多一种情况而已，定义DP[i][j]为a以i结尾，b以j结尾的编辑距离，然后如果a[i]==b[j]，那么dp[i][j]=dp[i-1][j]， 否则的话dp[i][j] = min(dp[i - 1][j], min(dp[i - 1][j - 1], dp[i][j - 1])) + 1;  dp[i-1][j]可以考虑删除a的i，或者b中插入一个字符和a[i]匹配，dp[i][j-1]同理，dp[i-1][j-1]就是将a[i]变成b[j]或者b[j]变成a[i]

AC代码：

#include<bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e3 + 5;
const double eps = 1e9;
typedef long long LL;

int dp[MAXN][MAXN];
int main() {
	char str1[MAXN], str2[MAXN];
	scanf("%s %s", str1, str2);
	int len1 = strlen(str1), len2 = strlen(str2);
	for (int i = 0; i < len1; i++) dp[i][0] = i;
	for (int i = 0; i < len2; i++) dp[0][i] = i;
	for (int i = 1; i <= len1; i++) {
		for (int j = 1; j <= len2; j++) {
			if (str1[i - 1] == str2[j - 1]) {
				dp[i][j] = dp[i - 1][j - 1];
			}
			else {
				dp[i][j] = min(dp[i - 1][j], min(dp[i - 1][j - 1], dp[i][j - 1])) + 1;
			}
		}
	}
	printf("%d\n", dp[len1][len2]);
	return 0;
}