-
Notifications
You must be signed in to change notification settings - Fork 30
/
Copy pathisomorphic-strings.js
37 lines (35 loc) · 1.06 KB
/
isomorphic-strings.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
// 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.
//
// For example,
// Given "egg", "add", return true.
//
// Given "foo", "bar", return false.
//
// Given "paper", "title", return true.
//
// Note:
// You may assume both s and t have the same length.
/**
* @param {string} s
* @param {string} t
* @return {boolean}
*/
var isIsomorphic = function(s, t) {
const hashMapS = {};
const hashMapT = {};
for (var i = 0, l = s.length; i < l; i++) {
var sc = s.charAt(i);
var tc = t.charAt(i);
if (hashMapS[sc] === undefined && hashMapT[tc] === undefined) {
hashMapS[sc] = tc;
hashMapT[tc] = sc;
} else if (hashMapS[sc] !== tc) {
return false;
}
}
return true;
};