Edit Distance

最新推荐文章于 2019-04-16 22:44:18 发布

千寻221

最新推荐文章于 2019-04-16 22:44:18 发布

阅读量504

点赞数

分类专栏： LeetCode 文章标签： Java LeetCode String DP

本文链接：https://blog.csdn.net/u010378705/article/details/35566983

版权

LeetCode 专栏收录该内容

150 篇文章 0 订阅

订阅专栏

题目

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

方法

经典的编辑距离问题。

此处讲解清晰：http://www.cnblogs.com/biyeymyhjob/archive/2012/09/28/2707343.html

    public int minDistance(String word1, String word2) {
        if (word1 == null || word2 == null) {
            return 0;
        }
        int len1 = word1.length();
        int len2 = word2.length();
        if (len1 == 0 || len2 == 0) {
            return Math.max(len1, len2);
        }
        
        int[][] status = new int[len1 + 1][len2 + 1];
        for (int i = 0; i < len1 + 1; i++) {
            for (int j = 0; j < len2 + 1; j++) {
                if (i == 0) {
                    status[i][j] = j;
                } else if (j == 0) {
                    status[i][j] = i;
                } else {
                    int tempMin = Math.min(status[i - 1][j], status[i][j - 1]) + 1;
                    if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
                        status[i][j] = Math.min(tempMin, status[i - 1][j - 1]);
                    } else {
                        status[i][j] = Math.min(tempMin, status[i - 1][j - 1] + 1);
                     }
                }
            }
        }
        return status[len1][len2];
    }