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.
//a aa这种不通过
class Solution {
public:
string minWindow(string S, string T)
{
string res;
map<char, int> mmap;
map<char, int>::iterator iter;
if (T.size() == 0)
return res;
for (int i=0;i<T.size();i++)
{
mmap.insert(pair<char, int>(T[i], -1));
}
for (int i=S.size()-1;i>=0;i--)
{
if (mmap.find(S[i]) != mmap.end())
mmap[S[i]] = i;
}
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
if (-1 == iter->second)
return res;
}
res = S;
findmin(S,res, mmap);
for (int i=0;i<S.size();i++)
{
if (mmap.find(S[i]) != mmap.end())
{
mmap[S[i]] = i;
findmin(S,res, mmap);
}
}
return res;
}
void findmin(string &S, string &res, map<char, int> &mmap)
{
map<char, int> :: iterator iter;
int min = INT_MAX;
int max = INT_MIN;
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
min = iter->second<min?iter->second:min;
max = iter->second>max?iter->second:max;
if (max-min +1 > res.size())
return;
}
res = S.substr(min, max-min +1);
}
};
//multimap代替map
class Solution {
public:
string minWindow(string S, string T)
{
string res;
multimap<char, int> mmap;
multimap<char, int>::iterator iter;
if (T.size() == 0)
return res;
for (int i=0;i<T.size();i++)
{
mmap.insert(pair<char, int>(T[i], INT_MAX));
}
for (int i=S.size()-1;i>=0;i--)
{
multimap<char, int>::iterator iter1 = mmap.find(S[i]);
int count = mmap.count(S[i]);
multimap<char, int>::iterator itertmp = iter1;
if (count > 0)
{
while (count > 0)
{
itertmp = itertmp->second > iter1->second?itertmp:iter1;
++iter1;
--count;
}
itertmp->second = i;
}
}
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
if (INT_MAX == iter->second)
return res;
}
res = S;
findmin(S,res, mmap);
for (int i=0;i<S.size();i++)
{
multimap<char, int>::iterator iter1 = mmap.find(S[i]);
int count = mmap.count(S[i]);
multimap<char, int>::iterator itertmp = iter1;
if (count > 0)
{
while (count > 0)
{
if (iter1->second == i)
{
itertmp = iter;
break;
}
itertmp = itertmp->second < iter1->second?itertmp:iter1;
++iter1;
--count;
}
itertmp->second = i;
findmin(S,res, mmap);
}
}
return res;
}
void findmin(string &S, string &res, multimap<char, int> &mmap)
{
multimap<char, int> :: iterator iter;
int min = INT_MAX;
int max = INT_MIN;
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
min = iter->second<min?iter->second:min;
max = iter->second>max?iter->second:max;
if (max-min +1 > res.size())
return;
}
res = S.substr(min, max-min +1);
}
};
//优化
class Solution {
public:
string minWindow(string S, string T)
{
string res;
multimap<char, int> mmap;
if (T.size() == 0)
return res;
for (int i=0;i<T.size();i++)
mmap.insert(pair<char, int>(T[i], INT_MIN));
for (int i=0;i<S.size();i++)
{
multimap<char, int>::iterator iter1 = mmap.find(S[i]);
int count = mmap.count(S[i]);
multimap<char, int>::iterator itertmp = iter1;
if (count > 0)
{
while (count > 0)
{
itertmp = itertmp->second < iter1->second?itertmp:iter1;
++iter1;
--count;
}
itertmp->second = i;
findmin(S,res, mmap);//这里复杂度较高
}
}
return res;
}
void findmin(string &S, string &res, multimap<char, int> &mmap)
{
multimap<char, int> :: iterator iter;
int min = INT_MAX;
int max = INT_MIN;
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
if (iter->second == INT_MIN)
return;
min = iter->second<min?iter->second:min;
max = iter->second>max?iter->second:max;
if (max-min +1 > res.size() && res.size()>0)
return;
}
res = S.substr(min, max-min +1);
}
};
//网上的答案 窗口法
class Solution {
public:
string minWindow(string S, string T) {
int begin = 0;
int end = 0;
int minbegin = 0;
int minend = 0;
int minSize = INT_MAX;
vector<int> needFind(128, 0);
vector<int> Found(128, 0);
for(int i = 0; i < T.size(); i ++)
needFind[T[i]] ++;
Found[S[0]] ++;
int count = T.size();
if(needFind[S[0]] >= Found[S[0]])
count --;
while(true)
{
if(count == 0)
{//shrink begin
while(Found[S[begin]] > needFind[S[begin]])
{
Found[S[begin]] --;
begin ++;
}
int size = end-begin+1;
if(size < minSize)
{
minbegin = begin;
minend = end;
minSize = size;
}
}
if(end < S.size())
{
end ++;
Found[S[end]] ++;
if(needFind[S[end]] >= Found[S[end]])
count --;
}
else
break;
}
if(minSize != INT_MAX)
return S.substr(minbegin, minSize);
else
return "";
}
};
//网上的答案 窗口法 优化
class Solution {
public:
string minWindow(string S, string T) {
int begin = 0;
int minbegin = 0;
int minend = 0;
int minSize = INT_MAX;
int count = T.size();
vector<int> needFind(128, 0);//字符串默认只有0-128 也可以用map代替
vector<int> Found(128, 0);
for(int i = 0; i < T.size(); i ++)
needFind[T[i]] ++;
for (int end=0;end<S.size();end++)
{
Found[S[end]] ++;
if(needFind[S[end]] >= Found[S[end]])
count --;
//开始滑动
if(count == 0)
{
while(Found[S[begin]] > needFind[S[begin]])
{
Found[S[begin]] --;
begin ++;
}
int size = end-begin+1;
if(size < minSize)
{
minbegin = begin;
minend = end;
minSize = size;
}
}
}
return minSize != INT_MAX ? S.substr(minbegin, minSize) : "";
}
};
测试
#include<iostream>
#include<map>
#include<string>
#include<limits.h>
using namespace std;
class Solution {
public:
string minWindow(string S, string T)
{
string res;
map<char, int> mmap;
map<char, int>::iterator iter;
if (T.size() == 0)
return res;
for (int i=0;i<T.size();i++)
{
mmap.insert(pair<char, int>(T[i], -1));
}
for (int i=S.size()-1;i>=0;i--)
{
if (mmap.find(S[i]) != mmap.end())
mmap[S[i]] = i;
}
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
if (-1 == iter->second)
return res;
}
res = S;
findmin(S,res, mmap);
for (int i=0;i<S.size();i++)
{
if (mmap.find(S[i]) != mmap.end())
{
mmap[S[i]] = i;
findmin(S,res, mmap);
}
}
return res;
}
void findmin(string &S, string &res, map<char, int> &mmap)
{
map<char, int> :: iterator iter;
int min = INT_MAX;
int max = INT_MIN;
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
min = iter->second<min?iter->second:min;
max = iter->second>max?iter->second:max;
if (max-min +1 > res.size())
return;
}
res = S.substr(min, max-min +1);
}
};
class Solution1 {
public:
string minWindow(string S, string T)
{
string res;
multimap<char, int> mmap;
multimap<char, int>::iterator iter;
if (T.size() == 0)
return res;
for (int i=0;i<T.size();i++)
{
mmap.insert(pair<char, int>(T[i], INT_MAX));
}
for (int i=S.size()-1;i>=0;i--)
{
multimap<char, int>::iterator iter1 = mmap.find(S[i]);
int count = mmap.count(S[i]);
multimap<char, int>::iterator itertmp = iter1;
if (count > 0)
{
while (count > 0)
{
itertmp = itertmp->second > iter1->second?itertmp:iter1;
++iter1;
--count;
}
itertmp->second = i;
}
}
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
if (INT_MAX == iter->second)
return res;
}
res = S;
findmin(S,res, mmap);
for (int i=0;i<S.size();i++)
{
multimap<char, int>::iterator iter1 = mmap.find(S[i]);
int count = mmap.count(S[i]);
multimap<char, int>::iterator itertmp = iter1;
if (count > 0)
{
while (count > 0)
{
if (iter1->second == i)
{
itertmp = iter;
break;
}
itertmp = itertmp->second < iter1->second?itertmp:iter1;
++iter1;
--count;
}
itertmp->second = i;
findmin(S,res, mmap);
}
}
return res;
}
void findmin(string &S, string &res, multimap<char, int> &mmap)
{
multimap<char, int> :: iterator iter;
int min = INT_MAX;
int max = INT_MIN;
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
min = iter->second<min?iter->second:min;
max = iter->second>max?iter->second:max;
if (max-min +1 > res.size())
return;
}
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
cout<<iter->first<<" "<<iter->second<< " ";
}
cout<<endl;
res = S.substr(min, max-min +1);
}
};
class Solution2 {
public:
string minWindow(string S, string T)
{
string res;
multimap<char, int> mmap;
if (T.size() == 0)
return res;
for (int i=0;i<T.size();i++)
mmap.insert(pair<char, int>(T[i], INT_MIN));
for (int i=0;i<S.size();i++)
{
multimap<char, int>::iterator iter1 = mmap.find(S[i]);
int count = mmap.count(S[i]);
multimap<char, int>::iterator itertmp = iter1;
if (count > 0)
{
while (count > 0)
{
itertmp = itertmp->second < iter1->second?itertmp:iter1;
++iter1;
--count;
}
itertmp->second = i;
findmin(S,res, mmap);
}
}
return res;
}
void findmin(string &S, string &res, multimap<char, int> &mmap)
{
multimap<char, int> :: iterator iter;
int min = INT_MAX;
int max = INT_MIN;
for (iter=mmap.begin();iter!=mmap.end();iter++)
{
if (iter->second == INT_MIN)
return;
min = iter->second<min?iter->second:min;
max = iter->second>max?iter->second:max;
if (max-min +1 > res.size() && res.size()>0)
return;
}
res = S.substr(min, max-min +1);
}
};
int main()
{
Solution2 s;
cout<<s.minWindow("ADOBECODEBANCBA", "ABBC")<<endl;
}