LeetCode 205. Isomorphic Strings

最新推荐文章于 2025-05-14 15:08:29 发布

wuqingdeqing

最新推荐文章于 2025-05-14 15:08:29 发布

阅读量365

点赞数

CC 4.0 BY-SA版权

分类专栏：算法学习笔记文章标签：算法 leetcode java

本文链接：https://blog.csdn.net/wuqingdeqing/article/details/109266715

算法学习笔记专栏收录该内容

50 篇文章

订阅专栏

本文探讨了一种更节省空间的方法来判断两个字符串 s 和 t 是否同构，通过巧妙利用字符映射并避免重复映射。提供了一种改进的算法，降低了空间复杂度，适用于面试或实际编程挑战。

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

将两个字符串分别放入一个map里，每次判断map里的值是否符合预期。

class Solution {
    public boolean isIsomorphic(String s, String t) {
        int l = s.length();
        Map<Character, Character> map = new HashMap<>();
        for (int i = 0; i < l; i++) {
            if (map.containsKey(s.charAt(i))) {
                if (t.charAt(i) != map.get(s.charAt(i))) {
                    return false;
                }
            } else {
                if (map.values().contains(t.charAt(i))) {
                    return false;
                } else {
                    map.put(s.charAt(i), t.charAt(i));   
                }
            }
        }
        return true;
    }
}