LeetCode--Word Pattern---JavaScript&Java

JavaScript
/**
 * @param {string} pattern
 * @param {string} str
 * @return {boolean}
 */
var wordPattern = function(pattern, str) {
    var strArray = str.split(" ");
    var patternArray = pattern.split("");
    var i;
    var patternMap = {};
    var strMap = {};
    if(strArray.length != patternArray.length){
        return false;
    }
    for(i in pattern){
        if((typeof(strMap[pattern[i]]) !== "string") && (typeof(patternMap[strArray[i]]) !== "string")){
            strMap[pattern[i]] = strArray[i];
            patternMap[strArray[i]] = pattern[i];
        }
        else{
            if((typeof(strMap[pattern[i]]) !== "string") || (typeof(patternMap[strArray[i]]) !== "string")){
                return false;
            }
        }
    }
    return true;
};

Java

/** 
 * @author          johnsondu 
 * @problem         Word Pattern 
 * @url             https://leetcode.com/problems/word-pattern/ 
 * @timeComlexity   O(n) 
 * @spaceComplexity O(n) 
 * @strategy        Bfs 
 * @status          Accepted 
 */  
  
class Solution {  
public:  
    bool wordPattern(string pattern, string str) {  
        map<char, string> mp1;  
        map<string, char> mp2;  
      
        // split word  
        vector<string> vec;  
        int len = str.size();  
        string word("");  
        for(int i = 0; i < len; i ++) {  
            if(str[i] == ' ') {  
                vec.push_back(word);  
                word = "";  
            }  
            else {  
                word += str[i];  
            }  
            if(i == len - 1) {  
                vec.push_back(word);  
            }  
        }  
      
        int n = pattern.size();  
        if(vec.size() != n) return false;  
        for(int i = 0; i < n; i ++) {  
            map<char, string>::iterator mp1Ite;  
            map<string, char>::iterator mp2Ite;  
            mp1Ite = mp1.find(pattern[i]);  
            mp2Ite = mp2.find(vec[i]);  
            if(mp1Ite == mp1.end() && mp2Ite == mp2.end()) {  
                mp1[pattern[i]] = vec[i];  
                mp2[vec[i]] = pattern[i];  
            }  
            else if(mp1Ite != mp1.end() && mp2Ite != mp2.end()) {  
                if(mp1[pattern[i]] != vec[i] || mp2[vec[i]] != pattern[i])  
                    return false;  
            }  
            else return false;  
        }  
        return true;  
    }  
};  

 类似题：LeetCode:Isomorphic Strings

/**
 * @param {string} s
 * @param {string} t
 * @return {boolean}
 */
var isIsomorphic = function(s, t) {
    var sMap = {},tMap = {},
        i = 0;
    if(s.length !== t.length){
        return false;
    }
    for(i in s){
        if((typeof(sMap[t[i]]) !== "string") && (typeof(tMap[s[i]]) !== "string")){
            sMap[t[i]] = s[i];
            tMap[s[i]] = t[i];
        }
        else{
            if((typeof(sMap[t[i]]) !== "string") || (typeof(tMap[s[i]]) !== "string") || (sMap[t[i]] !== s[i])){
                return false;
            }
        }
    }
    return true;
};