给定一种规律 pattern 和一个字符串 str ,判断 str 是否遵循相同的规律。
这里的 遵循 指完全匹配,例如, pattern 里的每个字母和字符串 str 中的每个非空单词之间存在着双向连接的对应规律。
示例1:
输入: pattern = “abba”, str = “dog cat cat dog”
输出: true
示例 2:
输入:pattern = “abba”, str = “dog cat cat fish”
输出: false
示例 3:
输入: pattern = “aaaa”, str = “dog cat cat dog”
输出: false
示例 4:
输入: pattern = “abba”, str = “dog dog dog dog”
输出: false
说明:
你可以假设 pattern 只包含小写字母, str 包含了由单个空格分隔的小写字母。
class Solution {
public:
bool wordPattern(string pattern, string str) {
if((pattern == "" && str != "")||(pattern != "" && str == ""))
return false;
if(pattern == "" && str == "")
return true;
map<char,int>table1 = {{pattern[0],1}};
map<string,int>table2 = {};
vector<int>a(pattern.size());
vector<int>b;
a[0] = 1;
int num1 = 1;
int num2 = 1;
string s = "";
for(int i = 0;i<str.size();i++){
if(str[i] == ' '){
if(table2.count(s) == 0){
table2.insert(map<string,int>::value_type(s,num2));
b.push_back(num2++);
}else{
b.push_back(table2[s]);
}
s = "";
}else{
s += str[i];
}
}
if(table2.count(s) == 0){
table2.insert(map<string,int>::value_type(s,num2));
b.push_back(num2++);
}else{
b.push_back(table2[s]);
}
if(b.size() != pattern.size())
return false;
for(int i = 1;i<pattern.size();i++){
if(table1.count(pattern[i]) == 0){
num1++;
table1.insert(map<char,int>::value_type(pattern[i],num1));
a[i] = num1;
}else{
a[i] = table1[pattern[i]];
}
if(a[i] != b[i])
return false;
}
return true;
}
};