-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathisomorphic.py
45 lines (33 loc) · 1.11 KB
/
isomorphic.py
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
"""
205. Isomorphic Strings
Easy
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:
map={}
for i in range(0,len(s)):
if s[i] not in map and t[i] not in map.values():
map[s[i]]=t[i]
elif s[i] in map and map[s[i]]==t[i]:
continue
elif s[i] in map and map[s[i]]!=t[i]:
return False
else:
return False
print(map)
return True
print(Solution().isIsomorphic("foo",'bar'))