LeetCode - Edit Distance 题解

最新推荐文章于 2020-05-16 11:51:32 发布

风小西

最新推荐文章于 2020-05-16 11:51:32 发布

阅读量310

点赞数

分类专栏： Leetcode 文章标签： leetcode 动态规划

本文链接：https://blog.csdn.net/fenx91/article/details/41758099

版权

Leetcode 专栏收录该内容

43 篇文章 0 订阅

订阅专栏

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

分析

令f[i,j] 表示S1前i变成S2的前j所需要的最小步数。

f[i,j] = min(f[i-1,j-1](s1[i]==s2[j]), f[i-1,j-1]+1(s1[i]!=s2[j], f[i-1,j]+1, f[i,j-1]+1) 分别是替换、替换、删除、增加。

class Solution {
public:
    int minDistance(string word1, string word2) {
        int l1 = word1.length();
        int l2 = word2.length();
        vector<vector<int> > f(l1 + 1);
        for(auto &v:f)
            v = vector<int> (l2 + 1,-1);
        for(int j = 0;j <= l2;j++)
            f[0][j] = j;
        for(int i = 1; i <= l1; i++){
            f[i][0] = i;
            for(int j = 1;j <= l2; j++){
                f[i][j] = (word1[i - 1] == word2[j - 1])? f[i - 1][j - 1] : f[i - 1][j - 1] + 1;
                f[i][j] = min(f[i][j], f[i - 1][j] + 1);
                f[i][j] = min(f[i][j], f[i][j - 1] + 1);
            }
        }
        return f[l1][l2];

    }
};