205. 同构字符串（javascript）205. Isomorphic Strings

leetcode题目来源：https://leetcode-cn.com/problems/isomorphic-strings/
给定两个字符串 s 和 t ，判断它们是否是同构的。

如果 s 中的字符可以按某种映射关系替换得到 t ，那么这两个字符串是同构的。

每个出现的字符都应当映射到另一个字符，同时不改变字符的顺序。不同字符不能映射到同一个字符上，相同字符只能映射到同一个字符上，字符可以映射到自己本身。

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.

示例 1:

输入：s = “egg”, t = “add”
输出：true

示例 2：

输入：s = “foo”, t = “bar”
输出：false

示例 3：

输入：s = “paper”, t = “title”
输出：true

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

同构字符串----每字符 首次出现、最后出现、相同下标出现的位置始终相同

var isIsomorphic = function (s, t) {
    for(let i=0;i<s.length;i++){
        if(s.indexOf(s[i])!==t.indexOf(t[i])){
            return false
        }
    }
    return true
};

var isIsomorphic = function (s, t) {
    for (let i = s.length - 1; i >= 0; i--) {
        if (s.lastIndexOf(s[i]) !== t.lastIndexOf(t[i])) {
            return false
        }
    }
    return true
};

哈希表 存 索引。同构字符串，两个字符串相同索引值

var isIsomorphic = function (s, t) {
    let S = {}
    let T = {}
    for (let i = 0; i < s.length; i++) {
        if (S[s[i]] !== T[t[i]]) {
            return false
        }
        S[s[i]] = i
        T[t[i]] = i  
    }
    return true
};