题解 | 计算字符串的编辑距离

import java.util.Map;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String s, t;
        s = in.next();
        t = in.next();
        System.out.print(getMin(s,t));
    }
    public static int getMin(String s, String t) {
        int len1 = s.length();
        int len2 = t.length();
        int[][] dp = new int[len1+1][len2+1];
        for (int i = 0; i <= len1; i++) {
            dp[i][0] = i;
        }
        for (int i = 0; i <= len2; i++) {
            dp[0][i] = i;
        }
        for (int i = 1; i <= len1; i++) {
            char p = s.charAt(i-1);
            for (int j = 1; j <= len2; j++) {
                char q = t.charAt(j-1);
                if (p == q) {
                    dp[i][j] = dp[i - 1][j - 1];
                } else {
                    if (dp[i][j - 1] > dp[i - 1][j]) {
                        dp[i][j] = Math.min(dp[i - 1][j], dp[i - 1][j - 1]) + 1;
                    } else {
                        dp[i][j] = Math.min(dp[i][j - 1], dp[i - 1][j - 1]) + 1;
                    }
                }
            }
        }
        return dp[len1][len2];
    }
}