LeetCode----Isomorphic Strings

最新推荐文章于 2022-09-27 11:11:35 发布

原创最新推荐文章于 2022-09-27 11:11:35 发布 · 950 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #python #Isomorphic Strings

Python 同时被 3 个专栏收录

127 篇文章

订阅专栏

算法之美

95 篇文章

订阅专栏

编程之美

93 篇文章

订阅专栏

本文探讨了如何通过算法判断两个字符串是否具有同构性，即一个字符串中的字符能否通过某种映射规则替换为另一个字符串中的字符，同时保持原有的顺序不变。

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

Isomorphic Strings

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.

分析：

跟Word Pattern一样的题，一样的思路。

代码：

class Solution(object):
    def isIsomorphic(self, s, t):
        """
        :type s: str
        :type t: str
        :rtype: bool
        """
        wd = dict()
        s_l = len(s)
        s_t = len(t)
        if s_l != s_t:
            return False
        wd = dict(map(lambda a: (a, None), list(s)))
        for i in range(s_l):
            if wd[s[i]] is None:
                wd[s[i]] = t[i]
            else:
                if wd[s[i]] != t[i]:
                    return False
        ds = set()
        for i in wd:
            ds.add(wd[i])
        if len(ds) != len(wd):
            return False
        return True