【Leetcode刷题笔记】290. Word Pattern map以及string映射

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.

Example 1:

Input: pattern = "abba", str = "dog cat cat dog"
Output: true
Example 2:

Input:pattern = "abba", str = "dog cat cat fish"
Output: false
Example 3:

Input: pattern = "aaaa", str = "dog cat cat dog"
Output: false
Example 4:

Input: pattern = "abba", str = "dog dog dog dog"
Output: false
Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.

Accepted
130,367
Submissions
377,752

思路：本题是要判断str中出现的string串的分布规律模式是否和pattern中表示的一致。
很显然，我们需要将pattern中的字符和string串中由空格" "分割开来的串进行mapping，这里就使用到了map。然后在遍历pattern来进行判断，当前pattern对应的str是否是map中对应的。

    bool wordPattern(string pattern, string str) {
        map<char,string>m;
        vector<string>s;
        for(int i=0;i<str.size();i++){
            int j = str.find(" " ,i);
            string sub = str.substr(i,j-i);
            s.push_back(sub);
            if(j==-1)break;
            i = j;
        }
        int _p = pattern.size();
        int _s = s.size();
        if(_p != _s)return false;
        for(int i=0;i<_p;i++){
            for(auto x:m){
                if(x.first==pattern[i]&&x.second!=s[i])return false;
                if(x.first!=pattern[i]&&x.second==s[i])return false;
            }
             m[pattern[i]] = s[i]；
        }
        return true;
    }