[LeetCode C++/Python3] 76. Minimum Window Substring

最新推荐文章于 2025-04-23 16:11:55 发布

原创最新推荐文章于 2025-04-23 16:11:55 发布 · 122 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode每日一题专栏收录该内容

172 篇文章

订阅专栏

本文深入探讨了如何使用滑动窗口技术解决最小覆盖子串问题，提供了Python和C++两种语言的实现方案，详细解释了算法的工作原理，包括初始化需要的字符计数、窗口移动策略以及有效状态检查。

Python3 Solution:

from collections import defaultdict
class Solution:
    def minWindow(self, s: str, t: str) -> str:
        need = defaultdict(int)
        window = defaultdict(int)
        for ch in t:
            need[ch] += 1
        
        left, right = 0, 0
        valid = 0
        
        start, nlen = 0, float('inf')
        while right < len(s):
            ch = s[right]
            right += 1
            
            if ch in need:
                window[ch] += 1
                if window[ch] == need[ch]:
                    valid += 1
                    
            while valid == len(need):
                if right - left < nlen:
                    start = left
                    nlen = right - left
                
                ch = s[left]
                left += 1
                if ch in need:
                    if window[ch] == need[ch]:
                        valid -= 1
                    window[ch] -= 1
        
        return "" if nlen == float('inf') else s[start:start+nlen]

C++ Solution:

class Solution {
public:
    string minWindow(string s, string t) {
        unordered_map<char, int> need, window;
        for(auto c:t)
            need[c]++;
        
        int left = 0, right = 0;
        int valid = 0;
        int start = 0, len = INT_MAX;
        
        while(right < s.size()){
            char ch = s[right];
            right++;
            if(need.count(ch)){
                window[ch]++;
                if(window[ch] == need[ch])
                    valid++;
            }
            while(valid == need.size()){
                if(right - left < len){
                    start = left;
                    len = right - left;                
                }

                ch = s[left];
                left++;
                if(need.count(ch)){
                    if(window[ch] == need[ch])
                        valid--;
                    window[ch]--;
                }
            }
        } 
        return len == INT_MAX ? "" : s.substr(start, len);
    }
};