Edit Distance（dp）

题目描述：

Edit Distance

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)
You have the following 3 operations permitted on a word:
     a) Insert a character
     b) Delete a character

     c) Replace a character

/****

一开始以为只要求出两个字符串的最大公共子序列的长度，再把这个去减max(len1, len2)就行了，结果wa了，比如str1 = abcd, str2 = abdc。答案就错了。                               

****/

dp[i][j]记录str1[1...i]到str2[1...j]的最小编辑次数

由此推出

1.dp[i][0] = i

2.dp[0][j] = j

3.dp[i][j] = dp[i-1][j-1] (str1[i] == str2[j])

4.dp[i][j] = min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1]) + 1 (str1[i] != str2[j])

知道这些转移方程就可以自底向上推出结果了。

代码：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn = 2005;
char str1[maxn], str2[maxn];
int dp[maxn][maxn];
int main(void)
{
    while(~scanf(" %s %s", str1, str2))
    {
        memset(dp, 0, sizeof(dp));
        int len1 = strlen(str1);
        int 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-1], min(dp[i-1][j], dp[i][j-1]))+1;
            }
        printf("%d\n", dp[len1][len2]);
    }
    return 0;
}