题目:
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 {
private int src[][];
private char w1[];
private char w2[];
int m,n;
public int minDistance(String word1, String word2) {
m = word1.length();
n = word2.length();
src = new int[m][n];
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
src[i][j] = -1;
}
}
w1 = word1.toCharArray();
w2 = word2.toCharArray();
return calculate2(0,0);
}
public int calculate2(int x,int y){
if(x==m&&y==n){
return 0;
}
if(x==m&&y<n){
return n-y;
}
if(y==n&&x<m){
return m-x;
}
if(src[x][y]>=0){
return src[x][y];
}
if(w1[x] == w2[y]){
src[x][y] = calculate2(x+1,y+1);
return src[x][y];
}
src[x][y] = Math.min(calculate2(x,y+1),Math.min(calculate2(x+1,y),calculate2(x+1,y+1))) + 1;
return src[x][y];
}
}
解析:
大体思想是用一个二维数组src[][],src[x][y]用来存储从word1的x处与word2的y处开始向右匹配,到匹配完成做需要的最少步数。
假设从左向右进行题目中说的3中操作(即在某位置,其左边已经全部相同,右边未知),情况分析:
1)若w1[x]与w2[y]相等,则x与y同时加1( calculate2(x+1,y+1) ),表示word1与word2向右移动一个字符
2)若w1[x]与w2[y]不相等,可以采用3个方法中的一种,但是我们不知道哪一种会使步数最小,所以我们依次进行测试,然后如其中的最小值。例如,若对word1进行插入操作,这个操作是虚拟的不会真正去做,则结果是word1的x值不变,word2由于已经成功匹配,所以y+=1。
3)当有一方的字符串匹配完时,若另一方还有剩余,则操作步数一定剩余一方的字符长度。