[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

基本思想：

求编辑距离。动态规划算法。(详细内容，明天补上，要回去岁觉了)。

代码：

public int min(int a1,int a2,int a3,int a4){  //Java
        int result = Math.min(a1,Math.min(a2,Math.min(a3,a4)));
        return result;
    }
    public int minDistance(String word1, String word2) {
        int size1 = word1.length();
        int size2 = word2.length();
        
        int [][] array = new int [size1+1][size2+1];
        for(int i =0; i <= size1; i++)
            array[i][0] = i;
        
        for(int i =0; i <= size2; i++)
            array[0][i] = i;
        
        for(int i = 1; i <= size1; i++){
            for(int j = 1; j<=size2; j++){
                int sameTail,insert,delete,replace;
                
                insert = array[i-1][j]+1;
                delete = array[i][j-1]+1;
                replace = array[i-1][j-1]+1;
                if(word1.charAt(i-1) == word2.charAt(j-1))
                    sameTail = array[i-1][j-1];
                else sameTail = insert; // suiyi
                array[i][j] = min(insert,delete,replace,sameTail);
            }
        }
        return array[size1][size2];
    }