Edit Distance

最新推荐文章于 2025-05-31 15:52:32 发布

ncst

最新推荐文章于 2025-05-31 15:52:32 发布

阅读量665

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/sinat_32547403/article/details/79999385

leetcode 专栏收录该内容

414 篇文章

订阅专栏

本文介绍了一种计算两个字符串之间编辑距离的算法，并通过一个Java实现的例子详细解释了该算法的工作原理。编辑距离是指通过插入、删除或替换字符将一个字符串转换为另一个字符串所需的最小操作数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given two words word1 and word2, find the minimum number of operations required to convert word1 to word2.

You have the following 3 operations permitted on a word:

Insert a character
Delete a character
Replace a character

Example 1:

Example 2:

java

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