Leetcode:Edit Distance

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

    计算两个字符串之间的距离。第一眼看到这个题的时候，感觉很熟悉，应该在很多面试书中看到过。个人觉得这个算法应该是面试中常考的，所以应该熟悉掌握。

运用递归，主要算法思想为：

Algorithm:

minDistance(i,j)=1+min(minDistance(i-1,j),minDistance(i,j-1),minDistance(i-1,j-1));

用一个二维数组表示两个字符串前n个字符之间的距离，然后使用以上算法，即可实现。实现代码如下：

public class Solution {
    public int minDistance(String word1, String word2) {
        int n = word1.length();
        int m = word2.length();
        
        int[][] dp = new int[n+1][m+1];
        for(int i=0; i< m+1; i++){
            dp[0][i] = i; 
        }
        for(int i=0; i<n+1; i++){
            dp[i][0] = i;
        }
        
        
        for(int i = 1; i<n+1; i++){
            for(int j=1; j<m+1; j++){
                if(word1.charAt(i-1) == word2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1];
                }else{
                    dp[i][j] = 1 + Math.min(dp[i-1][j-1],Math.min(dp[i-1][j],dp[i][j-1]));
                }
            }
        }
        return dp[n][m];
    }
}