Time: 32 ms (74.62%), Space: 16.6 MB (36.29%) - LeetHub

Author: hogan-tech

0290-word-pattern/0290-word-pattern.py

@@ -0,0 +1,22 @@
+class Solution:
+    def wordPattern(self, pattern: str, s: str) -> bool:
+        patternMap, wordMap = {}, {}
+        words = s.split(" ")
+        if len(words) != len(pattern):
+            return False
+        for char, word in zip(pattern, words):
+            if char not in patternMap:
+                if word in wordMap:
+                    return False
+                else:
+                    patternMap[char] = word
+                    wordMap[word] = char
+            else:
+                if patternMap[char] != word:
+                    return False
+        return True
+
+
+pattern = "abba"
+s = "dog cat cat dog"
+print(Solution().wordPattern(pattern, s))