LeetCode 290. Word Pattern

class Solution {
public:
    bool wordPattern(string pattern, string str) {
    	vector<string> strvec;
    	map<char,string> mmap;
    	stringstream stringcin(str);
    	while(stringcin >> str)
    		strvec.push_back(str);

    	if(pattern.size() != strvec.size()) return false;
    	for(int i = 0;i<pattern.size();i++)
    	{
    		if(mmap.find(pattern[i]) == mmap.end())
    		{
    			for(auto item:mmap)
    			for(map<char,string>::iterator it = mmap.begin();it!=mmap.end();++it)
    			{
    				if(it->second == strvec[i])
    					return false;
    			}
    			mmap.insert(make_pair(pattern[i],strvec[i]));
    		}
    		else if(mmap[pattern[i]] != strvec[i])
    			return false;
    	}
    	return true;
    }
};