目录
一、题目
编辑距离__牛客网
给定两个单词word1和word2,请计算将word1转换为word2至少需要多少步操作。
你可以对一个单词执行以下3种操作:
a)在单词中插入一个字符
b)删除单词中的一个字符
c)替换单词中的一个字符
二、举例分析
三、关键代码
int minDistance(string word1, string word2) {
int n1 = word1.length();
int n2 = word2.length();
if (n1 == 0 && n2 == 0)
return 0;
vector<vector<int>>dp(n1+1,vector<int>(n2+1,0));
for (int i = 0; i <= n1; i++)//初始化第一列
{
dp[i][0] = i;
}
for (int j = 0; j <= n2; j++)//初始化第一行
{
dp[0][j] = j;
}
for (int i = 1; i <= n1; i++)//从dp数组的第一行开始
{
for (int j = 1; j <= n2; j++)
{
if (word1[i-1] == word2[j-1])//word1的第一个字符下标是0
{
dp[i][j] = dp[i-1][j-1];
}
else
{
dp[i][j] = min(dp[i][j - 1], min(dp[i - 1][j], dp[i - 1][j - 1]))+1 ;
}
}
}
//打印dp数组
/*for (int i = 0; i <= n1; i++)
{
for (int j = 0; j <= n2; j++)
{
cout << dp[i][j] << " ";
}
cout << endl;
}*/
return dp[n1][n2];
};
四、完整代码
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int minDistance(string word1, string word2) {
int n1 = word1.length();
int n2 = word2.length();
if (n1 == 0 && n2 == 0)
return 0;
vector<vector<int>>dp(n1+1,vector<int>(n2+1,0));
for (int i = 0; i <= n1; i++)//初始化第一列
{
dp[i][0] = i;
}
for (int j = 0; j <= n2; j++)//初始化第一行
{
dp[0][j] = j;
}
for (int i = 1; i <= n1; i++)//从dp数组的第一行开始
{
for (int j = 1; j <= n2; j++)
{
if (word1[i-1] == word2[j-1])//word1的第一个字符下标是0
{
dp[i][j] = dp[i-1][j-1];
}
else
{
dp[i][j] = min(dp[i][j - 1], min(dp[i - 1][j], dp[i - 1][j - 1]))+1 ;
}
}
}
//打印dp数组
/*for (int i = 0; i <= n1; i++)
{
for (int j = 0; j <= n2; j++)
{
cout << dp[i][j] << " ";
}
cout << endl;
}*/
return dp[n1][n2];
};
int main()
{
string s1 = "radle";
string s2 = "apple";
int x=minDistance(s1, s2);
return 0;
}