這一題和之前做過的題目一樣满俗，都是建立pattern和string之間的哈希表月杉，最后需要去重一下甚亭，代碼如下：
class Solution(object):
def wordPattern(self, pattern, str):
"""
:type pattern: str
:type str: str
:rtype: bool
"""
l = str.split()
if len(pattern) != len(l):
return False
dic = {}
for i in range(len(pattern)):
if pattern[i] not in dic:
dic[pattern[i]] = l[i]
else:
if dic[pattern[i]] != l[i]:
return False
if len(set(dic.values())) != len(dic):
return False
else:
return True
