-
-
Notifications
You must be signed in to change notification settings - Fork 51.1k
Expand file tree
/
Copy pathis_isomorphic.py
More file actions
48 lines (37 loc) · 1.21 KB
/
Copy pathis_isomorphic.py
File metadata and controls
48 lines (37 loc) · 1.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
def is_isomorphic(s: str, t: str) -> bool:
"""
Given two strings s and t, determine if they are isomorphic.
https://en.wikipedia.org/wiki/Isomorphism
https://leetcode.com/problems/isomorphic-strings/description/
Two strings s and t are isomorphic if the characters in s can be
replaced to get t.
All occurrences of a character must be replaced with another character
while preserving the order of characters. No two characters may map to
the same character, but a character may map to itself.
>>> is_isomorphic("egg", "add")
True
>>> is_isomorphic("foo", "bar")
False
>>> is_isomorphic("paper", "title")
True
>>> is_isomorphic("ab", "aa")
False
"""
if len(s) != len(t):
return False
mapping: dict[str, str] = {}
mapped = set()
for char_s, char_t in zip(s, t):
if char_s in mapping:
if mapping[char_s] != char_t:
return False
else:
if char_t in mapped:
return False
mapping[char_s] = char_t
mapped.add(char_t)
return True
if __name__ == "__main__":
import doctest
doctest.testmod()
print(is_isomorphic("egg", "add")) # True