给定一种规律 pattern 和一个字符串 str ,判断 str 是否遵循相同的规律。
这里的 遵循 指完全匹配,例如, pattern 里的每个字母和字符串 str 中的每个非空单词之间存在着双向连接的对应规律。
示例1:
输入: pattern = "abba", str = "dog cat cat dog"
输出: true
示例 2:
输入:pattern = "abba", str = "dog cat cat fish"
输出: false
示例 3:
输入: pattern = "aaaa", str = "dog cat cat dog"
输出: false
示例 4:
输入: pattern = "abba", str = "dog dog dog dog"
输出: false
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/word-pattern
建立哈希表映射
class Solution:
def wordPattern(self, pattern: str, str: str) -> bool:
word_list = str.split()
if len(set(pattern))!= len(set(word_list)): #避免"abba","dog dog dog dog"
return False
if len(pattern)!=len(word_list): #长度不等,模式不同
return False
str_map = {}
for i,val in enumerate(pattern):
if val not in str_map.keys():
str_map[val]=word_list[i] #建立字母与单词的映射
if str_map[val]==word_list[i]:
continue
else:
return False
return True
LeetCode评论里的两行代码,出自@缪小伟 https://leetcode-cn.com/u/mou-xiao-wei/
原来map还能这样用:
class Solution:
def wordPattern(self, pattern: str, str: str) -> bool:
res=str.split()
return list(map(pattern.index, pattern))==list(map(res.index,res))
# pattern.index('a')返回pattern字符串中字符‘a’首次出现的位置
两个两个比较 pattern和词 是同时相等还是同时不等:
class Solution:
def wordPattern(self, pattern: str, str: str) -> bool:
word_list = str.split()
if len(set(pattern))!= len(set(word_list)):
return False
if len(pattern)!=len(word_list):
return False
for i in range(len(pattern)-1):
if pattern[i]==pattern[i+1] and word_list[i]!=word_list[i+1]:
return False
elif pattern[i]!=pattern[i+1] and word_list[i]==word_list[i+1]:
return False
return True