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"
.
头尾指针, 循环 { 先尾指针后移,后移到全部包含,再头指针后移,后移到前边的不能再舍去为止 ,取得窗口}
class Solution {
public:
string minWindow(string s, string t) {
if(s.size()==0 || s.size()
0){
ScharCount[s[wind_end]]++;
if(ScharCount[s[wind_end]]<=TcharCount[s[wind_end]]) // 重复多匹配的没有用,不需要matchCount++
matchCount++;
}
if(matchCount==t.size()){ //end 后移动,移动到全匹配就收缩头start,判断是否最小,然后end再后移动……
while(ScharCount[s[win_start]]>TcharCount[s[win_start]] || TcharCount[s[win_start]]==0){
ScharCount[s[win_start]]--;
win_start++;
}
if (minWidth > (wind_end - win_start + 1)) {
minWidth = wind_end - win_start + 1;
min_start = win_start;
}
}
wind_end++;
}
if(minWidth==INT_MAX)
return "";
else
return s.substr(min_start, minWidth);
}
};