简单题。同样的做法。
290.
class Solution: def wordPattern(self, pattern: str, str: str) -> bool: p={} q=str.split(‘ ‘) if len(pattern)!=len(q): return False for i in range(len(pattern)): if pattern[i] in p: if p[pattern[i]]!=q[i]: return False else: if q[i] not in q[:i]: p[pattern[i]]=q[i] else: return False return True
class Solution: def isIsomorphic(self, s: str, t: str) -> bool: p={} for i in range(len(s)): if s[i] in p: if p[s[i]]!=t[i]: return False else: if t[i] not in t[:i]: p[s[i]]=t[i] else: return False return True
原文：https://www.cnblogs.com/taoyuxin/p/11688738.html