小黑跟中老黑阿黄小黄车刷夜天津，勾起智齿疼痛去朝阳医院拔牙，去淄博自驾去厦门重庆特种兵，见到了三年不见的线上同门的leetcode之旅：76. 最小覆盖子串

最新推荐文章于 2024-08-10 22:52:22 发布

爱喝喜茶爱吃烤冷面的小黑黑

最新推荐文章于 2024-08-10 22:52:22 发布

阅读量258

点赞数

分类专栏：小黑的日常leetcode之旅文章标签： leetcode linux 算法

本文链接：https://blog.csdn.net/qq_37418807/article/details/131481081

版权

小黑的日常leetcode之旅专栏收录该内容

225 篇文章 1 订阅

订阅专栏

小黑根据题解思路，独立写出代码

class Solution:
    def minWindow(self, s: str, t: str) -> str:
        # 两个字符串的长度
        n_s = len(s)
        n_t = len(t)
        if n_s < n_t:
            return ''
        # 寻找初始的解,之后进行滑动窗口迭代
        # 计数字典与计数变量
        map_ = collections.Counter(t)
        count_map = collections.Counter(t)
        count = n_t
        # 头尾指针
        head = 0
        tail = 0
        # 是否找到初始位置
        flag = False
        # 最优解
        result = n_t + n_s
        result_s = ''
        while tail < n_s:
            if not flag:
                if count_map.get(s[tail]):
                    count_map[s[tail]] -= 1
                    count -= 1
                    # 初始条件找到
                    if not count:
                        count = n_t
                        # 重构计数字典，为当前窗口的字符统计
                        count_map = collections.Counter(s[:tail+1])
                        flag = True
                tail += 1
            if flag:
                # 扩大窗口
                while count < n_t and tail < n_s:
                    if map_.get(s[tail]):
                        count_map[s[tail]] += 1
                        if count_map[s[tail]] == map_[s[tail]]:
                            count += 1
                    tail += 1
                # 缩小窗口
                while count == n_t:    
                    if tail - head < result:
                        result = tail - head 
                        result_s = s[head:tail]
                    # 扔掉窗口前置字符
                    if count_map.get(s[head]):
                        count_map[s[head]] -= 1
                        if count_map[s[head]] < map_[s[head]]:
                            count -= 1 
                    head += 1
        return result_s

在这里插入图片描述

双指针滑动窗口法

class Solution:
    def minWindow(self, s: str, t: str) -> str:
        # 两个字符串长度
        n_s = len(s)
        n_t = len(t)
        if n_s < n_t:
            return ''
        # 定义计数字典
        count_t = collections.Counter(t)
        count_map = collections.defaultdict(int)
        # 定义双指针
        head = 0
        tail = 0
        # 结果
        result = n_s + n_t
        result_s = ''
        # 开始迭代
        while tail < n_s:
            count_map[s[tail]] += 1
            # 移动head指针
            while self.check(count_t, count_map):
                if tail - head + 1 < result:
                    result = tail - head + 1
                    result_s = s[head:tail+1]
                count_map[s[head]] -= 1
                head += 1
            tail += 1
        return result_s
    def check(self, count_t, count_map):
        for key in count_t:
            if count_map[key] < count_t[key]:
                return False
        return True