[LeetCode] Edit Distance

zjjee

于 2014-12-18 16:31:04 发布

阅读量308

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/zjjee/article/details/42007141

LeetCode 专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一个算法，用于计算将一个单词转换为另一个单词所需的最少步骤数，涉及插入、删除和替换操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

class Solution {
public:
    int minDistance(string word1, string word2) {
        int len1 = word1.size() + 1,len2 = word2.size() + 1;
        vector<vector<int> >p(len1,vector<int>(len2));
        p[0][0] = 0;
        for(int i = 1;i < len1;i ++)
            p[i][0] = i;
        for(int i = 1;i < len2;i ++)
            p[0][i] = i;
        for(int i = 1;i < len1;i ++){
            for(int j = 1;j < len2;j ++){
                if(word1[i - 1] == word2[j - 1])
                    p[i][j] = p[i - 1][j - 1];
                else{
                    p[i][j] = p[i - 1][j - 1] + 1;
                    p[i][j] = min(p[i][j],min(p[i - 1][j] + 1,p[i][j - 1] + 1));
                }
            }
        }
        return p[len1 - 1][len2 - 1];
    }
};

参考