LeetCode 290. Word Pattern

 1 class Solution {
 2 public:
 3     vector<string> split(string str){
 4         vector<string> res;
 5         string tmp = "";
 6         for(int i = 0; i < str.length(); ++i){
 7             if(str[i] != ‘ ‘) {
 8                 if(i == str.length() - 1) res.push_back(tmp + str[i]);
 9                 tmp += str[i];
10             }
11             else{
12                 res.push_back(tmp);
13                 tmp = "";
14             }
15         }
16         return res;
17     }
18     bool wordPattern(string pattern, string str) {
19         vector<string> res = split(str);
20         
21         if(pattern.length() != res.size()) return false;
22         map<char, string> corre;
23         map<char, string>::iterator it;
24         set<string> word;
25         set<string>::iterator itr;
26         for(int i = 0; i < pattern.length(); ++i){
27             it = corre.find(pattern[i]);
28             if(it == corre.end()){
29                 itr = word.find(res[i]);
30                 if(itr != word.end()) return false;
31                 corre.insert(pair<char, string>(pattern[i], res[i]));
32                 word.insert(res[i]);
33             }
34             else{
35                 if(it->second != res[i]) return false;
36             }
37         }
38         return true;
39     }
40 };