leetcode：290. Word Pattern

最新推荐文章于 2019-10-22 07:18:22 发布

原创最新推荐文章于 2019-10-22 07:18:22 发布 · 313 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

leetcode解题报告专栏收录该内容

13 篇文章

订阅专栏

本文介绍了一种用于判断字符串str是否遵循给定模式pattern的算法。该算法通过建立双向映射确保pattern中的每个字符与str中的非空单词一一对应，从而实现完全匹配。文章提供了具体的实现代码示例。

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.

Examples:

pattern = "abba", str = "dog cat cat dog" should return true.
pattern = "abba", str = "dog cat cat fish" should return false.
pattern = "aaaa", str = "dog cat cat dog" should return false.
pattern = "abba", str = "dog dog dog dog" should return false.

Notes:

You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.

/**
 * @param {string} pattern
 * @param {string} str
 * @return {boolean}
 */
var wordPattern = function(pattern, str) {
    var wordMap = {};
    var letterMap = {};
    var strArr = str.split(' ');
    if(strArr.length !== pattern.length) return false;
    for(var i = 0; i <pattern.length; i++) {
        if (typeof(wordMap[strArr[i]]) == "undefined") { 
            wordMap[strArr[i]] = pattern[i];
        } else if(wordMap[strArr[i]] !== pattern[i]) {
            return false;
        }  
        if (typeof(letterMap[pattern[i]]) == "undefined") { 
            letterMap[pattern[i]] = strArr[i];
        } else if(letterMap[pattern[i]] !== strArr[i]) {
            return false;
        }  
    }
    return true;
};