LeetCode 72. 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

参考自 点击打开链接

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