205. Isomorphic Strings

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

start_lie

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

阅读量83

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/start_lie/article/details/87881663

LeetCode 专栏收录该内容

121 篇文章

订阅专栏

本文介绍了一种用于判断两个字符串是否为同构性的算法。同构性意味着一个字符串可以通过字符替换转换为另一个字符串，同时保持字符出现的顺序不变。文章通过示例详细解释了同构性的概念，并提供了一个具体的实现代码，该代码使用了映射表的方法来检查字符串的同构性。

摘要生成于 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.

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

Note:
You may assume both s and t have the same length.

================================================================

Review :

using dictionary ath

================================================================

Code :

class Solution {
    public boolean isIsomorphic(String s, String t) {
        if (s.equals(t)){
            return true;
        }
        final char[] sArr = s.toCharArray();
        final char[] tarr = t.toCharArray();
        int[] map = new int[360];
        for (int i = sArr.length-1;i >= 0;i--) {
            if (map[sArr[i]] == 0 && map[tarr[i] + 180] == 0) {
                map[sArr[i]] = map[tarr[i] + 180] = i;
            }else if (map[sArr[i]] != map[tarr[i]+180]) {
                return false;
            }
        }
        return true;
    }
}