算法第12周Delete Operation for Two Strings[Medium]

Description

Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one character in either string.

Example 1:

Input: "sea", "eat"
Output: 2
Explanation: You need one step to make "sea" to "ea" and another step to make "eat" to "ea".

Note:
The length of given words won’t exceed 500.
Characters in given words can only be lower-case letters.

---

Solution

这道题目与之前的Edit Distance基本一致，只不过这里的编辑只允许采取删除操作。所以当两个字母不同时，需采取两步操作还不是一步。

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 : 2;
    }
};