【LeetCode】Edit Distance

最新推荐文章于 2020-06-22 10:16:26 发布

Snowwolf_Yang

最新推荐文章于 2020-06-22 10:16:26 发布

阅读量493

点赞数

分类专栏：字符串 LeetCode 动态规划矩阵

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/26864831

版权

LeetCode 同时被 3 个专栏收录

86 篇文章 0 订阅

订阅专栏

动态规划

17 篇文章 0 订阅

订阅专栏

字符串

11 篇文章 0 订阅

订阅专栏

参考链接

http://www.cnblogs.com/lihaozy/archive/2012/12/31/2840152.html

http://blog.csdn.net/lanxu_yy/article/details/17326837

题目描述

Edit Distance

Total Accepted: 8539 Total Submissions: 34577 My Submissions

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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int row = word1.length() + 1;
        int col = word2.length() + 1;
        
        vector<vector<int> > f(row, vector<int>(col));

        for (int i = 0; i < row; i++)
            f[i][0] = i;

        for (int i = 0; i < col; i++)
            f[0][i] = i;

        for (int i = 1; i < row; i++)
            for (int j = 1; j < col; j++){
                if (word1[i-1] == word2[j-1])
                    f[i][j] = f[i-1][j-1];
                else
                    f[i][j] = f[i-1][j-1] + 1;
                f[i][j] = min(f[i][j], min(f[i-1][j]+1, f[i][j-1]+1));
            }

        return f[row-1][col-1];
    }
};