Leetcode 205 Isomorphic Strings

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

pessis1

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

阅读量200

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode

本文链接：https://blog.youkuaiyun.com/pessis1/article/details/53641934

Leetcode 专栏收录该内容

167 篇文章

订阅专栏

本文介绍了一种判断两个字符串是否为同构的方法。通过使用字符映射数组的方式，确保字符串s中的字符可以被替换以得到字符串t，且字符的相对顺序不变。

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

iven 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.

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

我用map啃了好久还没啃出来==

只要相同字母出现位置是一样的那么m数组里面对应位置的值应该是同时修改的不一样则说明false

public class Solution {
    public boolean isIsomorphic(String s1, String s2) {
        int[] m = new int[512];
        for (int i = 0; i < s1.length(); i++) {
            if (m[s1.charAt(i)] != m[s2.charAt(i)+256]) return false;
            m[s1.charAt(i)] = m[s2.charAt(i)+256] = i+1;
        }
        return true;
    }
}