[LeetCode] 029: Edit Distance

最新推荐文章于 2020-06-02 09:57:27 发布

1.02^365的成长裂变

最新推荐文章于 2020-06-02 09:57:27 发布

阅读量3.6k

点赞数

分类专栏： LeetCode2

本文链接：https://blog.csdn.net/raojunyang/article/details/77925134

版权

LeetCode2 专栏收录该内容

140 篇文章 0 订阅

订阅专栏

[Problem]

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]

class Solution {
public:
    int minDistance(string word1, string word2) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        
        // at least one of them is empty
        if(word1.size() == 0 || word2.size() == 0){
            return word1.size() + word2.size();
        }
        
        // initial
        int **dp = new int*[word1.size()+1];
        for(int i = 0; i <= word1.size(); ++i){
            dp[i] = new int[word2.size()+1];
            dp[i][0] = i;
        }
        for(int i = 0; i <= word2.size(); ++i){
            dp[0][i] = i;
        }
        
        // dp
        for(int i = 1; i <= word1.size(); ++i){
            for(int j = 1; j <= word2.size(); ++j){
                if(word1[i-1] == word2[j-1]){
                    dp[i][j] = dp[i-1][j-1];
                }
                else{
                    dp[i][j] = min(min(dp[i-1][j], dp[i][j-1]), dp[i-1][j-1]) + 1;
                }
            }
        }
        return dp[word1.size()][word2.size()];
    }
};