Leetcode-290 Word Pattern(单词模式)

class Solution
{
    public:
        int getWordEnd;
        string getWord(string str)
        {
            string tmp;
            int i;
            for(i = getWordEnd;str[i] != ' '&& str[i]!='';i ++)
            {
                tmp += str[i];
            }
            getWordEnd = i+1;
            return tmp;
        }
        bool wordPattern(string pattern, string str)
        {
            map<char,string> m;
            map<string,char> m2;
            getWordEnd = 0;
            for(int i = 0;i < pattern.size();i ++)
            {
                string word = getWord(str);
                if(!m.count(pattern[i]))
                {
                    m[pattern[i]] = word;
                    if(!m2.count(word))
                    {
                        m2[word] = pattern[i];
                    }
                    else
                    {
                        return false;
                    }
                }
                else if(m[pattern[i]] != word)
                {
                    cout << i <<endl;
                    return false;
                }
            }

            if(getWordEnd-1 != str.size())
                return false;
            return true;
        }
};