leetcode-72. Edit Distance

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

基本思路就是典型的DP算法。首先构造一个word1.length+1×word2.length+1大小的数组，然后就是分两种情况一种是如果对于[i][j]当word1[i]和word2[j]的位置相同，则相当于位置不变，就是[i][j]=[i-1][j-1];如果不想等则需要通过插入、删除替换来使得word1[0-i]和word2[0-j]相等。分别对应与[i-1][j]、[i][j-1]和[i-1][j-1]操作当然需要加1。

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