?LeetCode刷題實(shí)戰(zhàn)205：同構(gòu)字符串

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

解題

class Solution:
    def isIsomorphic(self, s: str, t: str) -> bool:
        for i in range(len(s)):
            if s.index(s[i]) != t.index(t[i]):
                return False
        return True