题解 | 小红的字符串修改

import java.util.Scanner;

// KMP？字符串匹配？
public class Main {
    public static void main(String[] args) {
        //先判断长度是否一致，长度一致的话，可以从头改到尾，次数为字母之间的距离'a'-'b'，主要看小+26 -大,大 - 小,长度不一致，需要
        Scanner in = new Scanner(System.in);
        String s = in.nextLine();
        String t = in.nextLine();
        int n = s.length();
        int m = t.length();
        if(m < n){
            System.out.println(-1);
            return;
        }
        int minOpt = Integer.MAX_VALUE;
        for(int i = 0; i <= m-n; i++){
            String sub = t.substring(i,i+n);
            int cost = 0;
            for(int j = 0; j < n; j++){
                char c1 = s.charAt(j);
                char c2 = sub.charAt(j);
                cost += charDistance(c1,c2);
            }
            minOpt = Math.min(cost,minOpt);
        }
        System.out.println(minOpt);

    }

    public static int charDistance(char a, char b){
        int diff = Math.abs(a - b);
        return Math.min(diff,26 - diff);
    }
}