LeetCode-290. 单词规律-easy

题目链接

class Solution {
public:
    bool wordPattern(string pattern, string s) {
        int len=pattern.length();
        string *str=new string[len]; //string数组
        int index=0;
        for(int i=0;i<s.length();i++){
            if(s[i]!=' ') str[index]+=s[i];
            else index++;
        }
        if(index!=len-1) return false;
        map<char,string> mp1;
        map<string,char> mp2;
        for(int i=0;i<len;i++){
            if(mp1.find(pattern[i])!=mp1.end()&&mp1[pattern[i]]!=str[i]||
            mp2.find(str[i])!=mp2.end()&&mp2[str[i]]!=pattern[i]) return false;
            mp1[pattern[i]]=str[i];
            mp2[str[i]]=pattern[i];
        }
        return true;
    }
};