Skip to content

Files

Latest commit

e2a85e9 · Nov 4, 2022

History

History
39 lines (35 loc) · 993 Bytes

205_isomorphic_strings.md

File metadata and controls

39 lines (35 loc) · 993 Bytes

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.

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

Solution

class Solution:
    def isIsomorphic(self, s: str, t: str) -> bool:
        dic = dict()
        for i in range(len(s)):
            if s[i] in dic and dic[s[i]] != t[i]:
                return False
            dic[s[i]] = t[i]
        sset = set(list(s))
        tset = set(list(t))
        if len(sset) != len(tset):
            return False
        return True