205. Isomorphic Strings

最新推荐文章于 2022-05-06 14:10:50 发布

jianingkid

最新推荐文章于 2022-05-06 14:10:50 发布

阅读量141

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/jianingkid/article/details/52203598

leetcode 专栏收录该内容

96 篇文章

订阅专栏

本文介绍了一种方法来判断两个给定的字符串是否为同型字符串。即一个字符串中的字符是否可以替换得到另一个字符串，所有出现的字符都必须用另一个字符替换，同时保留原有的字符顺序。

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

For example,
Given "egg", "add", return true.

Given "foo", "bar", return false.

Given "paper", "title", return true.

同型字符串

public class Solution {
    public boolean isIsomorphic(String s, String t) {
        Map<Character,Integer> sm=new HashMap<>();
        Map<Character,Integer> tm=new HashMap<>();
        for(Integer  i=0;i<s.length();i++)//这里必须要注意是Integer不是int
        {
            if(sm.put(s.charAt(i),i)!=tm.put(t.charAt(i),i))
                    return false;
        
        }
        return true;
        
    }
}