leetcode290---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.

问题求解：

使用hash表unordered_map求解。

class Solution {
public:
    bool wordPattern(string pattern, string str) {
        unordered_map<char, int> um1;
        unordered_map<string, int> um2;

        string str_tmp, key;
        int start = -1;
        int ind_space;

        if(pattern.size()==0 && str.size()==0) return true;
        if(pattern.size()==0 && str.size()!=0) return false;
        if(pattern.size()!=0 && str.size()==0) return false;

        str_tmp = str;

        for(int i=0; i<pattern.size(); i++){

            // 从start+1处一直截取到字符串最后
            str_tmp = str_tmp.substr(start+1);
            // 找到空格的位置
            start = str_tmp.find(' ');
            // 得到当前单词
            key = str_tmp.substr(0,start);

            //（1）如果pattern[i]和key中只有一个出现过
            if(um1.find(pattern[i])!=um1.end() && um2.find(key)==um2.end()) return false;
            if(um1.find(pattern[i])==um1.end() && um2.find(key)!=um2.end()) return false;
            //find()方法。找到的话就是返回那个pattern[i]所在的iterator，找不到就返回end()
            //（2）如果都出现过，但是对应索引不等
            if(um1.find(pattern[i])!=um1.end() && um2.find(key)!=um2.end() && um1[pattern[i]] != um2[key]) return false;
            //如pattern = "abba"与str = "dog cat cat dog"是匹配的，即中间两个和两边的两个元素分别相等
            //hash映射。如果匹配，当前的pattern[i]与key对应的索引i必须是相等的。
            //(3)这种情况说明都没有出现过，或者都出现过且索引相等，那么更新索引
            um1[pattern[i]] = i; //建立字符pattern[i]与索引i的对应关系
            um2[key] = i;//建立单词key与索引i的对应关系
            // 检查两字符串的长度
            if(i == pattern.size()-1) // pattern已检查完毕
            {
                if(start > 0) // 而str还剩余元素
                return false;
            }
        }
        return true;
    }
};