class Solution {
public:
bool wordPattern(string pattern, string str) {
unordered_map<char, int>map;
unordered_map<string, int> map2;
istringstream in(str);
int i=0;
int n=(int)pattern.size();
for(string word;in>>word;i++)
{
if(map[pattern[i]]==0)
map[pattern[i]]=i+1;
if(map2[word]==0)
map2[word]=i+1;
if(i==n||map[pattern[i]]!=map2[word])
return false;
}
if(i<=n-1)
return false;
return true;
}
public:
bool wordPattern(string pattern, string str) {
unordered_map<char, int>map;
unordered_map<string, int> map2;
istringstream in(str);
int i=0;
int n=(int)pattern.size();
for(string word;in>>word;i++)
{
if(map[pattern[i]]==0)
map[pattern[i]]=i+1;
if(map2[word]==0)
map2[word]=i+1;
if(i==n||map[pattern[i]]!=map2[word])
return false;
}
if(i<=n-1)
return false;
return true;
}
};
耗时好久 不管了