题解 | #字符串最小变换次数#

import java.util.*;

public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        String str1 = sc.nextLine();
        String str2 = sc.nextLine();
        char[] arr1 = str1.toCharArray();
        char[] arr2 = str2.toCharArray();
        int[][] bp = new int[arr1.length+1][arr2.length+1];
        for(int i=0;i<=arr1.length;i++){
            bp[i][0] = i;
        }
        for(int i=0;i<=arr2.length;i++){
            bp[0][i] = i;
        }
        for(int i=1;i<=arr1.length;i++){
            for(int j=1;j<=arr2.length;j++){
                if(arr1[i-1] == arr2[j-1]){
                    bp[i][j] = bp[i-1][j-1];
                }else{
                    bp[i][j] = Math.min(bp[i-1][j-1],Math.min(bp[i][j-1],bp[i-1][j]))+1;
                }
            }
        }
        System.out.println(bp[arr1.length][arr2.length]);
    }
}