字符串转化的最小操作数

题目描述

Given two words word1 and word2, find the minimum number of operations required to convert word1to word2.
You have the following 3 operations permitted on a word:

1. Insert a character
2. Delete a character
3. Replace a character

Example 1:

Input: word1 = "horse", word2 = "ros"
Output: 3

Explanation:

horse -> rorse (replace 'h' with 'r')
rorse -> rose (remove 'r')
rose -> ros (remove 'e')

Example 2:

Input: word1 = "intention", word2 = "execution"
Output: 5

Explanation:

intention -> inention (remove 't')
intention -> enention (replace 'i' with 'e')
enention -> exention (replace 'n' with 'x')
exention -> exection (replace 'n' with 'c')
exection -> execution (insert 'u')

解题思路

使用动态规划算法
开一个二维数组d[i][j]来记录a0-ai与b0-bj之间的编辑距离，要递推时，需要考虑对其中一个字符串的删除操作、插入操作和替换操作分别花费的开销，从中找出一个最小的开销即为所求。
具体算法：
首先给定第一行和第一列，然后，每个值d[i,j]这样计算：d[i][j] = min(d[i-1][j]+1,d[i][j-1]+1,d[i-1][j-1]+(s1[i] == s2[j]?0:1));
最后一行，最后一列的那个值就是最小编辑次数

代码

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        String[] beforeText = new String[N];
        String[] afterText = new String[N];
        for (int i = 0; i < N; i++) {
            beforeText[i] = sc.next();
        }
        for (int i = 0; i < N; i++) {
            afterText[i] = sc.next();
        }
        System.out.println(getRes(beforeText, afterText));
    }

    public static int getRes(String[] before, String[] after){
        int N = before.length;
        int res = 0;
        for (int i = 0; i < N; i++) {
            res += getModifyTimes(before[i], after[i]);
        }

        return res;
    }

    public static int getModifyTimes(String str1, String str2){
       int[][] dp = new int[str1.length()+1][str2.length()+1];
        for (int i = 0; i < str1.length()+1; i++) {
            dp[i][0] = i;
        }
        for (int j = 0; j < str2.length()+1; j++) {
            dp[0][j] = j;
        }
        for (int i = 1; i < str1.length()+1; i++) {
            for (int j = 1; j < str2.length()+1; j++) {
                if (str1.charAt(i-1) == str2.charAt(j-1)){
                    dp[i][j] = dp[i-1][j-1];
                }else{
                    dp[i][j] = Math.min(Math.min(dp[i-1][j]+1, dp[i][j-1]+1), dp[i-1][j-1]+1);
                }
            }
        }

        return dp[str1.length()][str2.length()];
    }
}