"""
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.
Example 1:
Input: pattern = "abba", str = "dog cat cat dog"
Output: true
Example 2:
Input:pattern = "abba", str = "dog cat cat fish"
Output: false
Example 3:
Input: pattern = "aaaa", str = "dog cat cat dog"
Output: false
Example 4:
Input: pattern = "abba", str = "dog dog dog dog"
Output: false
Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.
Reference: https://leetcode.com/problems/word-pattern/description/
"""
from algorithms.map import word_pattern

pattern = "abba"
str = "dog cat cat dog"

print(word_pattern(pattern,str))

Exemple #2
0
 def test_word_pattern(self):
     self.assertTrue(word_pattern("abba", "dog cat cat dog"))
     self.assertFalse(word_pattern("abba", "dog cat cat fish"))
     self.assertFalse(word_pattern("abba", "dog dog dog dog"))
     self.assertFalse(word_pattern("aaaa", "dog cat cat dog"))
Exemple #3
0
 def test_word_pattern(self):
     self.assertTrue(word_pattern("abba", "dog cat cat dog"))
     self.assertFalse(word_pattern("abba", "dog cat cat fish"))
     self.assertFalse(word_pattern("abba", "dog dog dog dog"))
     self.assertFalse(word_pattern("aaaa", "dog cat cat dog"))