Leetcode - 290. Word Pattern

Javascript Code /** * @param {string} pattern * @param {string} s * @return {boolean} */ var wordPattern = function (pattern, s) { let patternMap = new Map(); let sMap = new Map(); if (pattern.length !== s.split(" ").length) { return false } let words = s.split(" "); for (let i = 0; i

Mar 17, 2025 - 18:33

Javascript Code


/**
 * @param {string} pattern
 * @param {string} s
 * @return {boolean}
 */
var wordPattern = function (pattern, s) {

    let patternMap = new Map();
    let sMap = new Map();

    if (pattern.length !== s.split(" ").length) {
        return false
    }
    let words = s.split(" ");
    for (let i = 0; i < pattern.length; i++) {

        if ((patternMap.has(pattern[i]) && patternMap.get(pattern[i]) !== words[i]) || (sMap.has(words[i]) && sMap.get(words[i]) !== pattern[i])) {
            return false;
        }
        patternMap.set(pattern[i], words[i]);
        sMap.set(words[i], pattern[i])

    }
    return true
};