LeetCode - Edit Distance

最新推荐文章于 2021-07-03 23:03:01 发布

yangyuwei11

最新推荐文章于 2021-07-03 23:03:01 发布

阅读量343

点赞数

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/yangyuwei11/article/details/10308917

版权

LeetCode 专栏收录该内容

121 篇文章

订阅专栏

本文详细阐述了将两个单词转换为相同形式所需的最少步骤数，包括插入、删除和替换操作。通过动态规划方法构建距离矩阵，实现高效计算。

摘要生成于 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) {
		vector<vector<int> > dis(word1.size()+1,vector<int>(word2.size()+1,0));
		for(int i=word1.size()-1;i>=0;i--){
			dis[i][word2.size()]=word1.size()-i;
		}
		for(int i=word2.size()-1;i>=0;i--){
			dis[word1.size()][i]=word2.size()-i;
		}

    	for(int i=word1.size()-1;i>=0;i--){
			for(int j=word2.size()-1;j>=0;j--){
				if(word1[i]==word2[j]){
					dis[i][j]=dis[i+1][j+1];
				}else{
					dis[i][j]=min(dis[i+1][j+1],dis[i][j+1]);
					dis[i][j]=min(dis[i][j],dis[i+1][j]);
					dis[i][j]++;
				}
			}
		}
       	return dis[0][0];
    }
};