题解 | 小红的字符串修改

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner=new Scanner(System.in);
		String s=scanner.next();
		String t=scanner.next();
		int min=999999999;
		for (int i = 0; i <= t.length()-s.length(); i++) {
			int count=0;
			for (int j = 0; j < s.length(); j++) {
				char c1=s.charAt(j);
				char c2=t.charAt(j+i);
				if(c1-c2>0) {//'h':8  'c':3 'z':26
					int a=c1-c2;
					int b='z'-c1+c2-'a'+1;
					int f=a<b?a:b;
					count+=f;
				}else {
					int a=c2-c1;
					int b='z'-c2+c1-'a'+1;
					int f=a<b?a:b;
					count+=f;
				}
			}
			if(count<min)min=count;
		}
		System.out.println(min);
		

	}

}

单纯暴力就能过，挪t的开始位置，然后逐一与s比对，求出此时的最小步数，如果此步数小于min就替换min