-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathisomorphic_strings.py
More file actions
46 lines (29 loc) · 980 Bytes
/
isomorphic_strings.py
File metadata and controls
46 lines (29 loc) · 980 Bytes
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
"""
Isomorphic Strings (Leetcode)
Given two strings s and t, determine if they are isomorphic.
Two strings 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.
Note:
You may assume both s and t have the same length.
>>> isIsomorphic("egg", "add")
True
>>> isIsomorphic("foo", "bar")
False
>>> isIsomorphic("paper", "title")
True
>>> isIsomorphic("ab", "aa")
False
"""
def isIsomorphic(s, t):
def make_comparator(string):
num_mappings = {}
comparator = ''
for i in range(len(string)):
if not num_mappings.get(i):
num_mappings[string[i]] = i
for letter in string:
comparator += str(num_mappings[letter])
return comparator
return make_comparator(s) == make_comparator(t)