[leetcode] 1208. Get Equal Substrings Within Budget

Description

You are given two strings s and t of the same length. You want to change s to t. Changing the i-th character of s to i-th character of t costs |s[i] - t[i]| that is, the absolute difference between the ASCII values of the characters.

You are also given an integer maxCost.

Return the maximum length of a substring of s that can be changed to be the same as the corresponding substring of twith a cost less than or equal to maxCost.

If there is no substring from s that can be changed to its corresponding substring from t, return 0.

Example 1:

Input: s = "abcd", t = "bcdf", maxCost = 3
Output: 3
Explanation: "abc" of s can change to "bcd". That costs 3, so the maximum length is 3.

Example 2:

Input: s = "abcd", t = "cdef", maxCost = 3
Output: 1
Explanation: Each character in s costs 2 to change to charactor in t, so the maximum length is 1.

Example 3:

Input: s = "abcd", t = "acde", maxCost = 0
Output: 1
Explanation: You can't make any change, so the maximum length is 1.

Constraints:

1. 1 <= s.length, t.length <= 10^5.
2. 0 <= maxCost <= 10^6.
3. s and t only contain lower case English letters.

分析

题目的意思是：给你一个数组，求在maxCost的限制下，s子串能够怎样通过字母变换操作最接近t的子串。这道题我看明白，但是发现在这种限制条件下好像不太会，最后发现利用滑动窗口就能够解决，因为是子串，所以是连续的，所以用curCost记录当前的最大代价，j记录子串的左边界，i从左到右进行遍历。满足条件就向右，不满足左边界向右。最后求所有可能子串的最大值。

代码

class Solution:
    def equalSubstring(self, s: str, t: str, maxCost: int) -> int:
        j=0
        n=len(s)
        curCost=0
        res=0
        for i in range(n):
            curCost+=abs(ord(s[i])-ord(t[i]))
            while(curCost>maxCost and j<=i):
                curCost-=abs(ord(s[j])-ord(t[j]))
                j+=1
            res=max(res,i-j+1)
        return res

参考文献

[LeetCode] python3 Sliding Window, easy to understand