package leetcode;

/**
 * https://leetcode.com/problems/get-equal-substrings-within-budget/
 */
public class Problem1208 {
    public int equalSubstring(String s, String t, int maxCost) {
        int size = s.length();
        int prev = 0;
        int answer = 0;
        int cost = maxCost;
        for (int cur = 0; cur < size; cur++) {
            int diff = Math.abs(s.charAt(cur) - t.charAt(cur));
            cost -= diff;
            if (cost < 0) {
                cost = maxCost - diff;
                answer = Math.max(answer, cur - prev);
                prev = cur;
            }
        }
        if (cost >= 0) {
            answer = Math.max(answer, size - prev);
        }
        return answer;
    }

    public static void main(String[] args) {
        Problem1208 prob = new Problem1208();
//        System.out.println(prob.equalSubstring("abcd", "bcdf", 3)); // 3
//        System.out.println(prob.equalSubstring("abaace", "bcxbdf", 3)); // 3
//        System.out.println(prob.equalSubstring("ababace", "bcxxbdf", 3)); // 3
//        System.out.println(prob.equalSubstring("abcd", "cdef", 3)); // 1
//        System.out.println(prob.equalSubstring("abcd", "acde", 0)); // 1
//        System.out.println(prob.equalSubstring("abcd", "bxdf", 2)); // 1
//        System.out.println(prob.equalSubstring("abcd", "bcde", 5)); // 4
        System.out.println(prob.equalSubstring("abcd", "cdef", 1)); // 0
    }
}

@@ -397,16 +397,209 @@
 (cur));%0A
+            if (diff %3E maxCost) %7B%0A                cost = maxCost;%0A                answer = Math.max(answer, cur - prev);%0A                prev = cur + 1;%0A                continue;%0A            %7D%0A
         
@@ -1533,16 +1533,18 @@
 ); // 4%0A
+//
         
@@ -1608,16 +1608,110 @@
 ); // 0%0A
+        System.out.println(prob.equalSubstring(%22ujteygggjwxnfl%22, %22nstsenrzttikoy%22, 43)); // 5%0A
     %7D%0A%7D%0A

Update problem 1208