编辑距离

编辑距离

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