单词模式

#include <unordered_map>
#include <iostream>
#include <string>
using namespace std;
class Solution {
public:
    bool wordPattern(string pattern, string str)
    {
            istringstream in(str);
            unordered_map <char,string> mymap;
            int i = 0;
            for(string word;in >> word; i++)//in流中为空就结束循环
            {
                if(mymap.find(pattern[i])!=mymap.end())
                {
                    if(mymap[pattern[i]]!=word)
                           return false;
                }
                else
                {
                    for(unordered_map<char,string>::iterator iter=mymap.begin();iter!=mymap.end();iter++)
                    {
                        if(iter->second==word)
                            return false;
                    }
                        mymap[pattern[i]] = word;
                }
            }
            return i==pattern.size();
    }
};