Edit Distance

最新推荐文章于 2024-09-14 19:44:09 发布

violin2696

最新推荐文章于 2024-09-14 19:44:09 发布

阅读量103

点赞数

分类专栏： OJ_leetcode 文章标签： java

本文链接：https://blog.csdn.net/violin2696/article/details/84352797

版权

OJ_leetcode 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

动规就是递推。。。比较难想然后数组长度设置比字符串长度多一，并做一定的初始化，都是为了方便边界条件的设置。。。。


public class Solution {
    public int minDistance(String word1, String word2) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int length1 = word1.length();
        int length2 = word2.length();
        int[][] distance = new int[length1+1][length2+1];
        for (int i = 0; i <= length1; i++)
            distance[i][0] = i;
        for (int i = 0; i <= length2; i++)
            distance[0][i] = i;
        for (int i = 1; i <= length1; ++i)
            for (int j = 1; j <= length2; ++j){
                int add = 1 + distance[i-1][j];
                int minus = 1 + distance[i][j-1];
                int replace = (word1.charAt(i-1) == word2.charAt(j-1) ? 0 : 1) + distance[i-1][j-1];
                distance[i][j] = Math.min(Math.min(add, minus), replace);
            }
        return distance[length1][length2];
    }
}