leetcode-3. Longest Substring Without Repeating Characters

题目：

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).

Example:

Input: S = “ADOBECODEBANC”, T = “ABC”
Output: “BANC”
Note:

If there is no such window in S that covers all characters in T, return the empty string “”.
If there is such window, you are guaranteed that there will always be only one unique minimum window in S.

题目描述：

一个字符串S，一个字符串T，在S里找到包含T中所有字符的字串，输出最短的一个

思路：

l，r双指针滑动窗口，创建一个hash数组保存T里所有字符个数。在设置一个ct保存匹配的个数，滑窗的时候如果符合就ct+1，ct=T内字符数就说明匹配满了。匹配完记录下本次结果，向右移动l指针，一直到不满足ct=T内字符长，中途可能产生更短的匹配串。

code：

class Solution {
public:
    string minWindow(string s, string t) {
        int hash_t[128]={0};//hash数组
        for(int i=0;i<t.length();++i){//初始化hash
          hash_t[t[i]]++;
        }
        int l=0,r=0;
        int len_min=s.length()+1,ct=0;
        int res_l=0,res_r=0;
        for(r=0;r<s.length();++r){
            if(--hash_t[s[r]]>=0){
                ct++;
            }
            while(ct==t.length()){
                if(r-l+1<len_min){
                    len_min=r-l+1;
                    res_l=l;
                    res_r=r;
                }
                if(++hash_t[s[l]]>0){
                    ct--;
                }
                l++;
            }
        }
        if(len_min==s.length()+1)
            return "";
        return s.substr(res_l,res_r-res_l+1);
    }
};