Leetcode 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

输入两个单词word1和word2，求出从word1转换成word2的最少步骤。每个转换操作算一步。转换操作限定于：

删除一个字符
插入一个字符
替换一个字符

本题用动态规划求解

设决策变量dp[i][j]，表示从word[0..i-1]转换为word2[0...j-1]的最少步骤

可以参考http://web.stanford.edu/class/cs124/lec/med.pdf

class Solution {

public:

    int minDistance(string word1, string word2) {

        int len1 =word1.length(), len2 = word2.length();

        if(len1 == ) return len2;

        if(len2 == ) return len1;

        if(word1 == word2) return ;

        vector<vector<int> > dp(len1+, vector<int>(len2+,));

        for(int i = ; i <= len1; ++ i) dp[i][] = i;

        for(int j = ; j <= len2; ++ j) dp[][j] = j;

        for(int i =; i <= len1; ++ i){

            for(int j = ; j <= len2; ++ j){

                dp[i][j] = min(dp[i-][j-]+(word1[i-] != word2[j-]? : ),min(dp[i-][j]+, dp[i][j-]+));

            }

        }

        return dp[len1][len2];

    }

};

巴特西

Leetcode Edit Distance

最新文章

热门文章