-
Notifications
You must be signed in to change notification settings - Fork 40
/
IsomorphicStrings.js
51 lines (47 loc) · 1.42 KB
/
IsomorphicStrings.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
// Source : https://leetcode.com/problems/isomorphic-strings/
// Author : Dean Shi
// Date : 2015-06-16
/**********************************************************************************
*
* 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) {
var s_map = {};
var t_map = {};
for (var i = 0, l = s.length; i < l; ++i) {
if (!s_map[s[i]] && !t_map[t[i]]) {
s_map[s[i]] = t[i];
t_map[t[i]] = s[i];
} else if (s_map[s[i]] !== t[i] || t_map[t[i]] !== s[i]) {
return false;
}
}
return true;
};
// Test cases
console.log(isIsomorphic('egg', 'add')); // true
console.log(isIsomorphic('foo', 'bar')); // false
console.log(isIsomorphic('paper', 'title')); // true