每周LeetCode算法题（九）: 72. Edit Distance

每周LeetCode算法题（九）

题目: 72. 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

解法分析

本题是动态规划的经典题目——编辑距离。题目的要求是，给定字符串A和字符串B，求在每次可以插入一个字符、删除一个字符或替换一个字符的情况下，将字符串A转化成B的操作次数。

求得状态转换方程为：dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1, diff + dp[i - 1][j - 1])。其中，i，j分别为字符串A，B的下标，diff在A，B相同下标处若字符相同为0，不同则为1。可以理解为，处理A的0到i的子串和B的0到j的子串，需要在处理A的0到i - 1的子串和B的0到j的子串的问题上对A删除一个字符，或在处理A的0到i的子串和B的0到j - 1的子串的问题上对A插入一个字符，又或者在处理A的0到i - 1的子串和B的0到j - 1的子串的问题上当A[i] != B[j]时对A替换一个字符。

C++代码

class Solution {
public:
    int minDistance(string word1, string word2) {
        int len1 = word1.size();
        int len2 = word2.size();
        int ** dp = new int*[len1 + 1];
        for (int i = 0; i <= len1; i++) {
            dp[i] = new int[len2 + 1];
            memset(dp[i], 0, sizeof(int) * (len2 + 1));
        }
        for (int j = 0; j <= len2; j++) {
            dp[0][j] = j;
        }
        for (int i = 0; i <= len1; i++) {
            dp[i][0] = i;
        }
        for (int i = 1; i <= len1; i++) {
            for (int j = 1; j <= len2; j++) {
                int diff = (word1[i - 1] == word2[j - 1]) ? 0 : 1;
                dp[i][j] = min(min(dp[i - 1][j], dp[i][j - 1]) + 1, diff + dp[i - 1][j - 1]);
            }
        }
        return dp[len1][len2];
    }
};