-
Notifications
You must be signed in to change notification settings - Fork 31
Expand file tree
/
Copy path0205-Isomorphic-Strings.py
More file actions
38 lines (24 loc) · 971 Bytes
/
Copy path0205-Isomorphic-Strings.py
File metadata and controls
38 lines (24 loc) · 971 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
'''
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.
Example 1:
Input: s = "egg", t = "add"
Output: true
Example 2:
Input: s = "foo", t = "bar"
Output: false
Example 3:
Input: s = "paper", t = "title"
Output: true
Note:
You may assume both s and t have the same length.
'''
class Solution:
def isIsomorphic(self, s: str, t: str) -> bool:
table_s, table_t = {}, {}
for i in range(len(s)):
if (s[i] in table_s and table_s[s[i]] != t[i]) or (t[i] in table_t and table_t[t[i]] != s[i]):
return False
table_s[s[i]], table_t[t[i]] = t[i], s[i]
return True