LeetCode OJ:Minimum Window Substring

最新推荐文章于 2024-09-16 06:54:08 发布

_王川

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量859

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/starcuan/article/details/18745447

版权

LeetCode 专栏收录该内容

152 篇文章 0 订阅

订阅专栏

Minimum Window Substring

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 emtpy string "".

If there are multiple such windows, you are guaranteed that there will always be only one unique minimum window in S.

双指针思想，尾指针不断往后扫，当扫到有一个窗口包含了所有T的字符，然后再收缩头指针，直到不能再收缩为止。最后记录所有可能的情况中窗口最小的

class Solution {
public:
    string minWindow(string S, string T) {
        if(S.empty()||T.empty())return "";
        int minSize=INT_MAX;
        int minStart;
        int flag[256]={0};
        int count[256]={0};
        for(int i=0;i<T.size();i++){
            flag[T[i]]++;
            count[T[i]]++;
        }
        int cnt=T.size();
        int start=0;
        for(int end=0;end<S.size();end++){
            if(flag[S[end]]){
                count[S[end]]--;
                if(count[S[end]]>=0)cnt--;
            }
            if(cnt==0){
                for(;start<=end;start++){
                    if(flag[S[start]]){
                        if(count[S[start]]<0)count[S[start]]++;
                        else break;
                    }
                }
                if(minSize>end-start+1){
                    minSize=end-start+1;
                    minStart=start;
                }
            }
        }
        if(minSize==INT_MAX)return "";
        return S.substr(minStart,minSize);
    }
};