题目
72. Edit Distance
Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.(将word1变成word2)
You have the following 3 operations permitted on a word:
1.Insert a character(增加)
2.Delete a character(删除)
3.Replace a character(替换)
Example 1:
Input: word1 = “horse”, word2 = “ros”
Output: 3
Explanation:
horse -> rorse (replace ‘h’ with ‘r’)
rorse -> rose (remove ‘r’)
rose -> ros (remove ‘e’)
Example 2:
Input: word1 = “intention”, word2 = “execution”
Output: 5
Explanation:
intention -> inention (remove ‘t’)
inention -> enention (replace ‘i’ with ‘e’)
enention -> exention (replace ‘n’ with ‘x’)
exention -> exection (replace ‘n’ with ‘c’)
exection -> execution (insert ‘u’)
思路
1.当word1长度为0时,操作数就是word2的长度(增加word2的所有字母)
2.当word2长度为0时,操作数就是word1的长度(删去word1的所有字母)
3.word1,2都不为0,当word1长为i,word2为j,设操作数为arr[i][j]:
-3.1对于word1[i]==word2[j],操作数就等于word1减掉最后一个字母转化成word2减掉一个字母,即arr[i-1][j-1]。
(将acb变成cgb,需要当操作数为arr[3][3]。因为word1[3]==word2[3](b=b),所以就等价于将a变成cg即arr[2][2]。)
-3.2对于对于word1[i] != word2[j],(ac变成cg)arr[i][j]分三种情况,括号内为操作数。
–3.2.1 a变成cg(arr[i-1][j]),减去c(arr[i-1][j]+1)
–3.2.2 a变成c(arr[i-1][j-1]),c变成g(arr[i-1][j-1]+1)
–3.2.3 ac变成c(arr[i][j-1]),加上g(arr[i][j-1]+1)
比较上面三种情况取最小的为arr[i][j]
根据上面的思路可以看出,这是一个动态规划问题,接下来画表格:
代码
class Solution {
public:
int minDistance(string word1, string word2) {
//输入word1和word2,获取长度
int n1 = word1.size();
int n2 = word2.size();
//定义二维数组
int arr[n1+5][n2+5];
arr[0][0]=0;
arr[0][1]=1;
arr[1][0]=1;
//word1为0或word2为0,直接写
for(int i=0;i<=n1;i++){
arr[i][0]=i;
}
for(int i=0;i<=n2;i++){
arr[0][i]=i;
}
for(int i=1;i<=n1;i++){
for(int j=1;j<=n2;j++){
//判断是否相同,相同直接取最小。不同最小加一。
if(word1[i-1] == word2[j-1]) arr[i][j] = min((arr[i-1][j] + 1), min((arr[i][j-1] + 1), (arr[i-1][j-1])));
else if(word1[i-1] != word2[j-1]) arr[i][j] = min((arr[i-1][j] + 1), min((arr[i][j-1] + 1), (arr[i-1][j-1] + 1)));
}
}
return arr[n1][n2];
}
};
结果