- 编辑距离
难度困难
给你两个单词 word1 和 word2,请你计算出将 word1 转换成 word2 所使用的最少操作数 。
你可以对一个单词进行如下三种操作:
- 插入一个字符
- 删除一个字符
- 替换一个字符
示例 1:
输入:word1 = "horse", word2 = "ros"
输出:3
解释:
horse -> rorse (将 'h' 替换为 'r')
rorse -> rose (删除 'r')
rose -> ros (删除 'e')
示例 2:
输入:word1 = "intention", word2 = "execution"
输出:5
解释:
intention -> inention (删除 't')
inention -> enention (将 'i' 替换为 'e')
enention -> exention (将 'n' 替换为 'x')
exention -> exection (将 'n' 替换为 'c')
exection -> execution (插入 'u')
提示:
- 0 <= word1.length, word2.length <= 500
- word1 和 word2 由小写英文字母组成
学习: - 动态规划思路:形成状态方程
自底向上:dp[i,j]=min(dp[i-1,j-1], dp[i,j-1], dp[i-1,j])+1 - 巧用min函数:
flag=min(a[i - 1][j - 1], min(a[i - 1][j], a[i][j - 1]));
思路:
- word1="",word2=“a”
考虑边界情况 - word1=“zoologicoarchaeologist”,word2=“zoogeologist”
对于状态方程,还有另一种情况,当word1[i]==word2[j]时,直接继承a[i-1][j-1]
代码:
class Solution {
public:
int minDistance(string word1, string word2) {
//动态规划
int i,j,flag;
int a[500+5][500+5]={0};
i=j=flag=0;
if(!word1.length()&&!word2.length())
return 0;
if(!word1.length()||!word2.length())
return 1;
word1=" "+word1;
word2=" "+word2;
while(i<word1.length())
{
a[i][0]=i;
i++;
}
while(j<word2.length())
{
a[0][j]=j;
j++;
}
i=j=1;
while(i<word1.length())
{
j=1;
while(j<word2.length())
{
if(word1[i]!=word2[j])
a[i][j]=min(a[i - 1][j - 1], min(a[i - 1][j], a[i][j - 1]))+1;
else
a[i][j]=a[i-1][j-1];
printf("%-7d",a[i][j]);
j++;
}
printf("\n");
i++;
}
return a[word1.length()-1][word2.length()-1];
}
};