class Solution {

 public:

     bool wordPattern(string pattern, string str) {

         if (pattern == "")return false;

         map<char, string>mp1;

         map<string, char>mp2;//一一对应

         vector<string>vs;

         int i;

         string s = "";

         for (i = ; i < str.size(); ++i) {

             if (str[i] == ' ') {

                 if (s != "")vs.push_back(s);

                 s = "";

             }

             else s += str[i];

         }

         if (s != "")vs.push_back(s);//注意最后一个单词

         if (pattern.size() != vs.size())return false;

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

             cout << vs[i] << " ";

             if (mp1.find(pattern[i]) != mp1.end()) {

                 if (mp1[pattern[i]] != vs[i])return false;

             }

             else mp1[pattern[i]] = vs[i];

             if (mp2.find(vs[i]) != mp2.end()) {

                 if (mp2[vs[i]] != pattern[i])return false;

             }

             else mp2[vs[i]] = pattern[i];

         }

         return true;

     }

 };