算法第九周Edit Distance[hard]

Edit Distance[hard]

---

Description

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

---

Solution

这是最小编辑距离问题，也是可以通过动态规划来解决；
两个字符串x[1…m],y[1…n]
E[i][j]表示x[1…i]和y[1…j]的最小编辑距离

   x[i]        -         x[i]
          or        or
    -         y[i]       y[j]       

动态规划方程：
E[i][j] = min(1+E[i-1][j], 1+E[i][j-1], diff(i，j)+E[i-1][j-1]);

class Solution {
public:
    int minDistance(string word1, string word2) {
        int m = word1.length();
        int n = word2.length();
        int E[m+1][n+1];
        for (int i = 0; i <= m; i++) {
            E[i][0] = i;
        }
        for (int j = 0; j <= n; j++) {
            E[0][j] = j;
        }
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                E[i][j] = min(E[i-1][j]+1, min(E[i][j-1]+1, E[i-1][j-1]+diff(word1[i-1],word2[j-1])));
            }
        }
        return E[m][n];
    }
    int diff(char a, char b) {
        return a == b? 0 : 1;
    }
};