class WordFilter {
public:
WordFilter(vector<string>& words) {
for(int i=0;i<words.size();i++){
string w = words[i];
for(int j=0;j<=w.size();j++){
mp[w.substr(0, j)].push_back(i);
}
for(int k=0;k<=w.size();k++){
ms[w.substr(k)].push_back(i);
}
}
}
int f(string prefix, string suffix) {
if(!mp.count(prefix) || !ms.count(suffix)) return -1;
vector<int> pre = mp[prefix];
vector<int> suf = ms[suffix];
int i = pre.size()-1;
int j = suf.size()-1;
while(i>=0 && j>=0){
if(pre[i]==suf[j]) return pre[i];
else if(pre[i]<suf[j]) j--;
else i--;
}
return -1;
}
private:
unordered_map<string, vector<int>> mp;
unordered_map<string, vector<int>> ms;
};
/**
* Your WordFilter object will be instantiated and called as such:
* WordFilter* obj = new WordFilter(words);
* int param_1 = obj->f(prefix,suffix);
*/
LeetCode - Prefix and Suffix Search
猜你喜欢
转载自blog.csdn.net/real_lisa/article/details/89199846
今日推荐
周排行