Question:
Given a pattern
and a string str
, find if str
follows the same pattern.
Here follow means a full match, such that there is a bijection between a letter in pattern
and a non-empty word in str
.
Examples:
- pattern =
"abba"
, str ="dog cat cat dog"
should return true. - pattern =
"abba"
, str ="dog cat cat fish"
should return false. - pattern =
"aaaa"
, str ="dog cat cat dog"
should return false. - pattern =
"abba"
, str ="dog dog dog dog"
should return false.
Notes:
You may assume pattern
contains only lowercase letters, and str
contains lowercase letters separated by a single space.
此题同205题,只不过需要先将str分词;
分词方法可以用stringstream类型(默认以空格和回车为分隔符);
代码如下:
<span style="font-size:14px;">class Solution {
public:
bool wordPattern(string pattern, string str) {
unordered_map<char,string> map1;
unordered_map<string,char> map2;
stringstream ss(str);
string word;
vector<string> strsplit;
while(ss >> word)
strsplit.push_back(word);
if(pattern.size() != strsplit.size())
return false;
else{
for(int i = 0; i < pattern.length(); ++i){
if(map1.find(pattern[i]) == map1.end())
map1[pattern[i]] = strsplit[i];
else{
if(strsplit[i] != map1[pattern[i]])
return false;
}
if(map2.find(strsplit[i]) == map2.end())
map2[strsplit[i]] = pattern[i];
else{
if(pattern[i] != map2[strsplit[i]])
return false;
}
}
return true;
}
}
};</span>