-
Notifications
You must be signed in to change notification settings - Fork 22
Expand file tree
/
Copy path205.isomorphic-strings.py
More file actions
61 lines (52 loc) · 1.53 KB
/
205.isomorphic-strings.py
File metadata and controls
61 lines (52 loc) · 1.53 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
49
50
51
52
53
54
55
56
57
58
59
60
61
# Tag: Hash Table, String
# Time: O(N)
# Space: O(N)
# Ref: -
# Note: -
# Given two strings s and t, determine if they are isomorphic.
# 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.
#
# 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
#
#
# Constraints:
#
# 1 <= s.length <= 5 * 104
# t.length == s.length
# s and t consist of any valid ascii character.
#
#
from collections import defaultdict
class Solution:
def isIsomorphic(self, s: str, t: str) -> bool:
n = len(s)
s_mask = defaultdict(int)
t_mask = defaultdict(int)
for i in range(n):
if s_mask[s[i]] != t_mask[t[i]]:
return False
s_mask[s[i]] = t_mask[t[i]] = i + 1
return True
class Solution:
def isIsomorphic(self, s: str, t: str) -> bool:
table = {}
n = len(s)
for i in range(n):
if s[i] in table and table[s[i]] != t[i]:
return False
table[s[i]] = t[i]
table = {}
for i in range(n):
if t[i] in table and table[t[i]] != s[i]:
return False
table[t[i]] = s[i]
return True