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
public class Solution {
public int minDistance(String word1, String word2) {
int m=word1.length();
int n=word2.length();
/*contain the general case*/
int[][] tab=new int[m+1][n+1];
/*Initialize the matrix*/
for(int i=0;i<=m;i++)tab[i][0]=i;
for(int i=0;i<=n;i++)tab[0][i]=i;
/*The recurtion*/
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++){
int isSame=1;
if(word1.charAt(i-1)==word2.charAt(j-1))isSame=0;
tab[i][j]=Math.min(tab[i-1][j-1]+isSame,Math.min(tab[i-1][j]+1,tab[i][j-1]+1));
}
return tab[m][n];
}
}
子问题:word1 的前i个字母到word2的前j个字母需要多少次修改。
用矩阵来记录子问题的结果,每个子问题的结果是三个值的比较。删除一个,添加一个,还有就是替换(看需不需要),取其中的最小值。在最开始的时候需要初始化矩阵。