leetcode 205: Isomorphic Strings

最新推荐文章于 2022-08-04 19:56:18 发布

xudli

最新推荐文章于 2022-08-04 19:56:18 发布

阅读量8.4k

点赞数 1

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.csdn.net/xudli/article/details/45386777

leetcode 专栏收录该内容

216 篇文章

订阅专栏

本文探讨了如何判断两个给定的字符串是否互为同构，即字符通过某种映射关系可以相互替换得到另一个字符串，且保持字符顺序不变。详细解释了同构字符串的概念，并提供了解决此类问题的算法实现。

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

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保存映射关系, 同时用一个set保持被映射的char, 保证同一个char 不会被映射两次.

[CODE]

public class Solution {
    //test case: "egg", "add"
    
    public boolean isIsomorphic(String s, String t) {
        //init check
        if(s==null || t==null) return false;
        if(s.length() != t.length()) return false;
        
        Map<Character, Character> map = new HashMap<Character, Character>();
        Set<Character> set = new HashSet<Character>();
        
        for(int i=0; i<s.length(); i++) {
            char c1 = s.charAt(i);
            char c2 = t.charAt(i);
            
            if(map.containsKey(c1)) {
                if(map.get(c1) != c2) return false;
            } else {
                if(set.contains(c2)) return false;
                else {
                    map.put(c1, c2);
                    set.add(c2);
                }
            }
        }
        return true;
    }
}