-
Notifications
You must be signed in to change notification settings - Fork 0
/
solution0022.js
65 lines (46 loc) · 1.35 KB
/
solution0022.js
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
62
63
64
65
// 205. Isomorphic Strings
// 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.
var isIsomorphic = function (s, t) {
if (s.length !== t.length) {
return false
}
const mapa = new Map()
const mapb = new Map()
for (let i = 0; i < s.length; i++) {
if (mapa.has(s[i])) {
if (mapa.get(s[i]) !== t[i]) {
return false
}
} else {
mapa.set(s[i], t[i])
}
if (mapb.has(t[i])) {
if (mapb.get(t[i]) !== s[i]) {
return false
}
} else {
mapb.set(t[i], s[i])
}
}
return true
};
console.log(isIsomorphic("egg", "add"));
// a = 1 b = 1 (e, a)
//t[1] = d t[i] = d
//s[0] = e s[i] = e
//