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:
Insert a character
Delete a character
Replace a character
res[i][j]表示的是word1的前i个字符和word2的前j个字符编辑的最少操作数是多少。假设我们拥有res[i][j]前的所有历史信息,看看如何在常量时间内得到当前的res[i][j],我们讨论两种情况:
1)如果word1[i-1]=word2[j-1],也就是当前两个字符相同,也就是不需要编辑,那么很容易得到res[i][j]=res[i-1][j-1],因为新加入的字符不用编辑;
2)如果word1[i-1]!=word2[j-1],那么我们就考虑三种操作,
如果是插入word1,那么res[i][j]=res[i-1][j]+1,也就是取word1前i-1个字符和word2前j个字符的最好结果,然后添加一个插入操作;
如果是插入word2,那么res[i][j]=res[i][j-1]+1,道理同上面一种操作;
如果是替换操作,那么类似于上面第一种情况,但是要加一个替换操作(因为word1[i-1]和word2[j-1]不相等);
接着是res[][]数组的初始化
for(int i=0;i<=len1;i++){
dis[i][0]=i;
}
这段代码意思是word2一个字母都不取,那么word1取多少字母,编辑距离就是多少。
class Solution {
public:
/**
* @param word1 & word2: Two string.
* @return: The minimum number of steps.
*/
int minDistance(string word1, string word2) {
// write your code here
int len1=word1.size();
int len2=word2.size();
if(len1==0){
return len2;
}
if(len2==0){
return len1;
}
vector<vector<int> > dis(len1+1,vector<int>(len2+1));
for(int i=0;i<=len1;i++){
dis[i][0]=i;
}
for(int j=0;j<=len2;j++){
dis[0][j]=j;
}
for(int i=1;i<=len1;i++){
for(int j=1;j<=len2;j++){
if(word1[i-1]==word2[j-1]){
dis[i][j]=dis[i-1][j-1];
}else{
dis[i][j]=min(min(dis[i-1][j],dis[i][j-1]),dis[i-1][j-1])+1;
}
}
}
return dis[len1][len2];
}
};
参考:
http://blog.csdn.net/linhuanmars/article/details/24213795
http://www.cnblogs.com/springfor/p/3896167.html