Minimum Window Substring

本文介绍了一种在字符串S中寻找包含字符串T所有字符的最小子串的算法,该算法的时间复杂度为O(n)。通过双指针及哈希表实现高效查找,并附带详细步骤说明。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).

For example,
S = “ADOBECODEBANC”
T = “ABC”
Minimum window is “BANC”.

Note:
If there is no such window in S that covers all characters in T, return the empty string “”.

If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.
思路:使用两个指针分别指向当前窗口的起始位置,使用哈希表charT存储t中字符出现的次数,使用哈希表find存储当前窗口中在t中出现的字符出现的次数(256个字符,使用数组代替哈希表即可),使用findCount记录找到在t中出现字符的个数(注意t中的字符可能会出现重复)。具体步骤:
(1)初始化charT
(2)遍历s,若charT[s[i]]非0,即s[i]出现在t中,find[s[i]]++,若find[s[i]]< charT[s[i]],findCount++
(3)如果findCount==len(t),表示找到一个符合的窗口,此时移动start,如果charT[s[start]]为0,则start++;若find[s[start]] > charT[s[start]],则find[s[start]] –,同时start++;否则停止移动start,此时s[start,i]即为满足条件的窗口。
(4)重复(2)(3),直至找到满足条件的最小窗口

class Solution {
public:
    string minWindow(string s, string t) {
        int lent = t.length();
        int lens = s.length();
        if(lent == 0 || lens == 0)
            return "";
        int charT[256] = {0};//t中的字符出现的次数
        int find[256] = {0};//窗口中在t中出现字符出现的次数
        int findCount = 0, start = 0, i;
        string win = "";
        for(i = 0; i < lent; ++i){
            charT[t[i]]++;
        }
        i = 0;
        while(i < lens){
            if(charT[s[i]]){
                find[s[i]] ++;
                if(find[s[i]] <= charT[s[i]])
                    findCount ++;
                if(findCount == lent){//找到一个窗口
                    while(1){
                        if(charT[s[start]] == 0)
                            start ++;
                        else if(find[s[start]] > charT[s[start]])
                            find[s[start++]]--;
                        else
                            break;
                    }
                    int a = i - start + 1;
                    if(win == "")
                        win = s.substr(start, a);
                    else
                        win = win.length() > a ? s.substr(start, a) : win;
                    find[s[start]]--;
                    start ++;
                    findCount --;
                }
            }
            i++;
        }
        return win;
    }
};
To solve this problem, we can use the sliding window approach again. Here's the algorithm: 1. Initialize two dictionaries: need and window. need stores the count of each character in t, and window stores the count of each character in the current window. 2. Initialize two pointers left and right to mark the current window, and two variables match and required to track the number of matched characters and the number of required characters respectively. 3. Initialize a variable min_len to a large value and a variable start to 0 to store the start index of the minimum window substring. 4. While the right pointer is less than the length of the string s: - If the character at s[right] is in need, add it to window and update match and required accordingly. - While all characters in need are included in window, update min_len and start accordingly, and remove the character at s[left] from window and update match and required accordingly. - Move the left pointer to the right. - Move the right pointer to the right. 5. Return the minimum window substring starting from index start and having length min_len, or the empty string if no such substring exists. Here's the Python code for the algorithm: ``` def min_window(s, t): need = {} for c in t: need[c] = need.get(c, 0) + 1 window = {} left = right = 0 match = 0 required = len(need) min_len = float('inf') start = 0 while right < len(s): if s[right] in need: window[s[right]] = window.get(s[right], 0) + 1 if window[s[right]] == need[s[right]]: match += 1 while match == required: if right - left + 1 < min_len: min_len = right - left + 1 start = left if s[left] in need: window[s[left]] -= 1 if window[s[left]] < need[s[left]]: match -= 1 left += 1 right += 1 return s[start:start+min_len] if min_len != float('inf') else "" ``` Example usage: ``` s = "ADOBECODEBANC" t = "ABC" print(min_window(s, t)) # Output: "BANC" ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值