# Leetcode 290. Word Pattern

146人阅读 评论(0)

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.

class Solution {
public:
bool wordPattern(string pattern, string str) {
stringstream ss(str);
string s;
vector<string> strvec;
while(ss>>s){
strvec.push_back(s);
}
if(strvec.size()!=pattern.size())
return false;                    //情况1
map<char,string> hash;
int i=0;
for(auto c:pattern){
if(!hash.count(c)){
hash[c]=strvec[i];
for(int j=0;j<i;++j){
if(hash[c]==strvec[j])
return false;        //情况2
}
}
else{
if(hash[c]!=strvec[i])
return false;           //情况3
}
++i;
}
return true;
}
};
bool wordPattern(string pattern, string str) {
map<char, int> p2i;
map<string, int> w2i;
istringstream in(str);
int i = 0, n = pattern.size();
for (string word; in >> word; ++i) {
if (i == n || p2i[pattern[i]] != w2i[word])
return false;                //对应不符合情况二和三
p2i[pattern[i]] = w2i[word] = i + 1;
}
return i == n;                      // 对应不符合情况一
}
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：12822次
• 积分：1024
• 等级：
• 排名：千里之外
• 原创：94篇
• 转载：7篇
• 译文：0篇
• 评论：0条