LeetCode-Hash-290. Word Pattern

问题：https://leetcode.com/problems/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
分析：字符与字符串的匹配问题。现转化str中的字符，把”dog cat cat dog” 变为”dog” ”cat” ”cat” ”dog”。然后用两个map，建立patern和str之间的关系，它俩必须一一对应才可以。 pattern中的元素由str中的元素一一对应，str也必须有pattern中的元素可以一对一的对应。
代码：

class Solution {
public:
    bool wordPattern(string pattern, string str) {
        int lp=pattern.size();
        vector<string>  ts;  
        int Bp=0,Ep=0;  
        while( Ep < str.size() ){  
            while(Ep < str.size()&& str[Ep]!=' ')  
                Ep++;  
            string tem=str.substr(Bp,Ep-Bp);  
            ts.push_back(tem);  
            Bp=++Ep;  
        }  
        int ls=ts.size();
        if(lp!=ls)  return false; 
        unordered_map<char,string>   m1;  
        unordered_map<string,char>   m2;  
        for(int i=0;i<lp;i++){  
            if(m1.find(pattern[i])==m1.end())  
                m1[pattern[i]]=ts[i];  
            else if(m1[pattern[i]]!=ts[i])  
                    return false;  

            if(m2.find(ts[i])==m2.end())
                m2[ts[i]]=pattern[i];  
            else if(m2[ts[i]]!=pattern[i])  
                    return false;  
        }  
        return true;  
    }
};