数据结构【哈希表、字符串】| leetcode 290. 单词规律(简单)

方法一：运用集合set和zip

class Solution:
    def wordPattern(self, pattern: str, s: str) -> bool:
        return (len(set(zip(pattern, s.split()))) == len(set(s.split())) == len(set(pattern))) \
                and (len(s.split()) == len(pattern))

方法二：哈希表，注意采用两个哈希表映射，否则下述测试示例会报错

代码链接：https://leetcode.cn/problems/word-pattern/solution/dan-ci-gui-lu-by-leetcode-solution-6vqv/

最后执行的输入：
"abc"
"b c a"

class Solution:
    def wordPattern(self, pattern: str, s: str) -> bool:
        word2ch = dict()
        ch2word = dict()
        words = s.split()
        if len(pattern) != len(words):
            return False
        
        for ch, word in zip(pattern, words):
            if (word in word2ch and word2ch[word] != ch) or (ch in ch2word and ch2word[ch] != word):
                return False
            word2ch[word] = ch
            ch2word[ch] = word
    
        return True