Isomorphic Strings

最新推荐文章于 2020-06-07 10:18:25 发布

原创最新推荐文章于 2020-06-07 10:18:25 发布 · 227 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Isomorphic #strings #js #leetcode

easy-算法专栏收录该内容

24 篇文章

订阅专栏

本文介绍了一个JavaScript函数，用于判断两个给定的字符串是否为同构字符串。同构字符串是指两个字符串中的字符可以相互替换，使得一个字符串变为另一个字符串，同时保持字符出现的顺序不变。文章通过具体的例子解释了同构字符串的概念，并提供了一个实现该功能的函数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

var isIsomorphic = function(s, t) {
    var obj = {};
    for(var i = 0; i < s.length; i++) {
        var charS = s.charAt(i);
        var charT = t.charAt(i);
        if(obj[charS]){
            if(obj[charS] != charT) {
                return false
            }
        }else{
            if(Object.values(obj).indexOf(charT) == -1){
                obj[charS] = charT
            }else{
                return false
            }
        }
    }
    return true
};