76. 最小覆盖子串

最新推荐文章于 2022-09-06 19:22:36 发布

zhulf0804

最新推荐文章于 2022-09-06 19:22:36 发布

阅读量187

点赞数

分类专栏： Leetcode 文章标签： leetcode python3 String Hard

本文链接：https://blog.csdn.net/zhulf0804/article/details/102076088

版权

Leetcode 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

给你一个字符串 S、一个字符串 T，请在字符串 S 里面找出：包含 T 所有字母的最小子串。

示例：

输入: S = "ADOBECODEBANC", T = "ABC"
输出: "BANC"

说明：

如果 S 中不存这样的子串，则返回空字符串 “”。
如果 S 中存在这样的子串，我们保证它是唯一的答案。

思路1: 暴力, 超时，通过了 226 / 268 个测试用例

from collections import Counter
class Solution:
    def minWindow(self, s: str, t: str) -> str:
        m, n = len(s), len(t)
        counter_t = Counter(t)
        min_len = float('inf')
        res = ""
        for i in range(m):
            counter_s = Counter(s[i:])
            for j in range(m-1, i-1, -1):
                child_len = j - i + 1
                if child_len < n or counter_s & counter_t != counter_t:
                    break
                counter_s -= Counter(s[j])
                if child_len < min_len:
                    min_len = child_len
                    res = s[i:j+1]
        return res

思路2: 二分查找, 超时, 通过 256 / 268 个测试用例

class Solution:
    def minWindow(self, s: str, t: str) -> str:
        m, n = len(s), len(t)
        counter_t = Counter(t)
        min_len = float('inf')
        res = ""
        for i in range(m):
            left, right = 0, m - 1
            while left < right:
                mid = (left + right) // 2
                if Counter(s[i:mid+1]) & counter_t == counter_t:
                    right = mid
                else:
                    left = mid + 1
            if Counter(s[i:left+1]) & counter_t == counter_t and left - i + 1 < min_len:
                min_len = left - i + 1
                res = s[i:left+1]
        return res

思路3: 滑动窗口 + Counter, 267 / 268 个通过测试用例, 仅一个测试用例没有通过

class Solution:
    def minWindow(self, s: str, t: str) -> str:
        m, n = len(s), len(t)
        counter_t = Counter(t)
        min_len = float('inf')
        res = ""
        left, right = 0, 0
        while left < m:
            while right < m and Counter(s[left:right+1]) & counter_t != counter_t:
                right += 1
            if right >= m:
                return res
            while left + 1 <= right and (Counter(s[left+1:right+1]) & counter_t) == counter_t:
                left += 1
            if right - left + 1 < min_len:
                min_len = right - left + 1
                res = s[left:right+1]
                #print(res)
            left += 1
        return res

思路4: 滑动窗口 + 字典，通过

class Solution:
    def minWindow(self, s: str, t: str) -> str:
        m, n = len(s), len(t)
        counter_t = Counter(t)
        min_len = float('inf')
        windows = {}
        formed = 0
        res = ""
        left, right = 0, 0
        while left < m:
            while right < m:
                if s[right] in t:
                    windows[s[right]] = windows.get(s[right], 0) + 1
                    if windows[s[right]] == counter_t[s[right]]:
                        formed += 1
                        if formed == len(counter_t):
                            break
                right += 1
            if right >= m:
                return res
            while left <= right:
                if s[left] not in t:
                    left += 1
                    continue
                if windows[s[left]] > counter_t[s[left]]:
                    windows[s[left]] -= 1
                    left += 1
                    continue
                break
            if right - left + 1 < min_len:
                min_len = right - left + 1
                res = s[left:right+1]

            windows[s[left]] -= 1
            formed -= 1
            left += 1
            right += 1
        return res

思路4写的很粗糙，思路不清晰，之后再整理出一个清晰的代码