LeetCode-Edit Distance

题目：https://oj.leetcode.com/problems/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

分析：

设状态为f[i][j]，表示A[0,i] 和B[0,j] 之间的最小编辑距离。设A[0,i] 的形式是str1c，B[0,j] 的形式是str2d，
1. 如果c==d，则f[i][j]=f[i-1][j-1]；
2. 如果c!=d，
    (a) 如果将c 替换成d，则f[i][j]=f[i-1][j-1]+1；
    (b) 如果在c 后面添加一个d，则f[i][j]=f[i][j-1]+1；
    (c) 如果将c 删除，则f[i][j]=f[i-1][j]+1；

源码：Java版本
算法分析：二维动态规划。时间复杂度O(m*n)，空间复杂度O(m*n)

public class Solution {
    public int minDistance(String word1, String word2) {
        int m=word1.length();
        int n=word2.length();
        int[][] f=new int[m+1][n+1];
        for(int i=0;i<m+1;i++) {
            f[i][0]=i;
        }
        for(int j=0;j<n+1;j++) {
            f[0][j]=j;
        }
        
        int delete,insert,replace; 
        for(int i=1;i<m+1;i++) {
            for(int j=1;j<n+1;j++) {
                if(word1.charAt(i-1)==word2.charAt(j-1)) {
                    f[i][j]=f[i-1][j-1];
                }else {
                    delete=f[i-1][j]+1;
                    insert=f[i][j-1]+1;
                    replace=f[i-1][j-1]+1;
                    f[i][j]=min(delete,insert,replace);
                }
            }
        }
        return f[m][n];
    }
    
    private int min(int a,int b,int c) {
        int min=a<b?a:b;
        return min<c?min:c;
    }
}