思路:利用hash建立pattern和str的映射,并用set进行去重,检查重复次数是否相等
class Solution {
public:
bool wordPattern(string pattern, string str) {
vector<string> tmp;
/*划分str方法1
int start = 0;//str中单词的开头位置
for (int end = 0; end < str.size(); ++end)//分割str
if (str[end] == ' ') {
tmp.emplace_back(str.substr(start, end - start));
start = end + 1;
}
tmp.emplace_back(str.substr(start, str.size() - start));
*/
//划分str方法2
stringstream out(str);//先将str存入string流中
string word;
while (out >> word) tmp.emplace_back(word);//遇到空格停止
if (tmp.size() != pattern.size()) return false;//个数不相等
map<char, string> hash;
for (int i = 0; i < tmp.size(); ++i) {
if (hash.count(pattern[i])) {//hash中有pattern[i]
if (hash[pattern[i]] != tmp[i]) return false;//检查映射是否相等
}
else hash.insert(map<char, string>::value_type(pattern[i], tmp[i]));//若不存在,将键值对插入hash
}
set<char> set_pat(pattern.begin(), pattern.end());//集合去重,初始化
set<string> set_tmp(tmp.begin(), tmp.end());
if (set_pat.size() != set_tmp.size()) return false;//若去重后数量若不相等,说明重复次数不同
return true;
}
};