尽可能使字符串相等

class Solution {
    public int equalSubstring(String s, String t, int maxCost) {
        int length = s.length();
        int[] costArr = new int[length];
        char[] sch = s.toCharArray();
        char[] tch = t.toCharArray();
        for (int i = 0; i < length; i++) {
            costArr[i] = Math.abs(sch[i] - tch[i]);
        }

        int max = 0;
        int cost = 0;
        for (int i = 0; i < length; i++) {
            cost += costArr[i];
            if (cost <= maxCost) {
                max++;
            } else {
                cost -= costArr[i - max];
            }
        }
        return max;
    }
}