【LeetCode 76】 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).

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.

思路

遍历t中字符，当符合条件时，左边界往前走，过程中记录最小值。
从右边界进入的字符，哈希表–，num–。左边界出去的字符，如果当前字符的哈希值==0，num++，哈希表++。

代码

class Solution {
public:
    string minWindow(string s, string t) {
        int num = t.length();
        unordered_map<char, int> has;
        for (char str : t) has[str]++;
        int res = INT_MAX;
        int left = 0, st = 0;
        
        for (int i=0; i<s.length(); ++i) {
            if (has[s[i]]-- > 0) num--;
            
            while(num == 0) {
                res = (i - left + 1 < res) ? (i - (st = left) + 1) : res;
                if (has[s[left++]]++ == 0) num++;
            }
        }
        
        return (res == INT_MAX) ? "" : s.substr(st, res);
    }
};