Leetcode每日一题
题目链接: 290. 单词规律
难度: 简单
解题思路: 这道题的意思就要是对pattern和s中的单词进行一一对应,若不能一一对应则说明是错误的匹配。按照这个逻辑进行处理就行了。
题解:
class Solution:
def wordPattern(self, pattern: str, s: str) -> bool:
words = s.split(' ')
if len(words) != len(pattern):
return False
dect = dict()
visit = dict()
for i in range(len(words)):
if pattern[i] not in dect:
if visit.get(words[i], 0) == 0:
dect[pattern[i]] = words[i]
visit[words[i]] = 1
else:
return False
if words[i] != dect[pattern[i]]:
return False
return True