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;
                answer = Math.max(answer, cur - prev);
                prev = cur;
            }
        }
        if (cost >= 0) {
            answer = Math.max(answer, size - 1 - 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("abcd", "cdef", 3)); // 1
//        System.out.println(prob.equalSubstring("abcd", "acde", 0)); // 1
//        System.out.println(prob.equalSubstring("abcd", "bxdf", 2)); // 1
    }
}

@@ -473,32 +473,39 @@
   cost = maxCost
+ - diff
 ;%0A              
@@ -670,12 +670,8 @@
 ze -
- 1 -
  pre
@@ -959,16 +959,99 @@
 ); // 3%0A
+//        System.out.println(prob.equalSubstring(%22ababace%22, %22bcxxbdf%22, 3)); // 3%0A//
         
@@ -1265,16 +1265,164 @@
 ); // 1%0A
+//        System.out.println(prob.equalSubstring(%22abcd%22, %22bcde%22, 5)); // 4%0A        System.out.println(prob.equalSubstring(%22abcd%22, %22cdef%22, 1)); // 0%0A
     %7D%0A%7D%0A

Update problem 1208