72. Edit Distance

最新推荐文章于 2020-07-18 00:38:39 发布

且听疯吟

最新推荐文章于 2020-07-18 00:38:39 发布

阅读量354

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/mml1106/article/details/78213485

leetcode 专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一个经典的字符串操作问题——编辑距离。通过递归方法和动态规划实现，文章详细解释了如何计算两个字符串之间的最小编辑距离，包括插入、删除和替换字符等操作。

摘要生成于 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

- 这道题目比较简单，在leetcode虽然是hard级别，但是递推关系还是比较容易推出来，
dp[i][j]为数列s1(0,…,i) ->s2(0,…,j)的数列转换的最小距离：

这里写图片描述

class Solution {
public:
    int minDistance(string word1, string word2) {
        int m = word1.size();
        int n = word2.size();

        vector<int> t(m+1,2147483647);
        vector<vector<int>> dp(n+1,t);
        for(int i = 0;i <= n;++i){
            dp[i][0] = i;
        }

        for(int i = 0;i <= m;++i){
            dp[0][i] = i;
        }

        for(int i = 1;i <= n;++i){
            for(int j = 1;j <= m;++j){
                /*insert a character*/
                dp[i][j] = min(dp[i-1][j]+1,dp[i][j]);
                /*delete a character*/
                dp[i][j] = min(dp[i][j-1]+1,dp[i][j]);
                /*repleace a character*/
                if(word2[i-1] == word1[j-1]){
                    dp[i][j] = min(dp[i-1][j-1],dp[i][j]);
                }else{
                    dp[i][j] = min(dp[i-1][j-1]+1,dp[i][j]);
                }
            }
        }

        return dp[n][m];
    }
};