#241 · #1208 · Get Equal Substrings Within Budget(尽可能使字符串相等)

You are given two strings s and t of the same length, and an integer maxCost. Changing s[i] to t[i] costs |s[i] - t[i]|. Return the maximum length of a substring of s that can be changed to match t within maxCost. Constraints: 1 <= s.length <= 10^5, lowercase letters.