leetcode 290. Word Pattern

Given a pattern and a string str, find if str follows the same pattern.

Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.

Example 1:

Input: pattern = "abba", str = "dog cat cat dog"
Output: true

Example 2:

Input:pattern = "abba", str = "dog cat cat fish"
Output: false

Example 3:

Input: pattern = "aaaa", str = "dog cat cat dog"
Output: false

Example 4:

Input: pattern = "abba", str = "dog dog dog dog"
Output: false

 

class Solution {
public:
 bool wordPattern(string pattern, string str)
 {
	 string temp="";
	 map<char,string> m;
     set<string> s;
	 vector<string> v;
	 for(auto x:str)
	 {
		 if(x!=' ')
		 {
			temp+=x; 
		 }
		 else
		 {
			 if(temp.size())
			 {
				 v.emplace_back(temp);
				 temp="";
			 }
		 }
	 }
	 if(temp.size())
	 {
		v.emplace_back(temp);
		temp="";
	 }
     if(v.size()!=pattern.size())return false;
	 for(int i=0;i<pattern.size();i++)
	 {
		if(m.find(pattern[i])!=m.end())
		{
			if(v[i]!=m[pattern[i]])
			{
				return false;
			}
		}
		else
		{
            if(s.find(v[i])!=s.end())
            {
                return false;
            }
			m[pattern[i]]=v[i];
            s.insert(v[i]);
		}
	 }
	 return true;
 }
};