Leetcode 290. Word Pattern

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.

很好的一道题目。

不符合的情况有三种：1、pattern和str长度不符 2、pattern中不同字母指向str中同一词（a、b->同一词） 3、同一字母指向不同词（a->不同词）

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;                      // 对应不符合情况一
}