python-algorithms/algorithms/map/word_pattern.py at master · plumnx/python-algorithms · GitHub

40 lines (36 loc) · 1.15 KB

"""

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/

"""

def word_pattern(pattern, str):

dict = {}

set_value = set()

list_str = str.split()

if len(list_str) != len(pattern):

return False

for i in range(len(pattern)):

if pattern[i] not in dict:

if list_str[i] in set_value:

return False

dict[pattern[i]] = list_str[i]

set_value.add(list_str[i])

else:

if dict[pattern[i]] != list_str[i]:

return False

return True

Expand file tree