205. Isomorphic Strings

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

csdnlmmmmmm

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

阅读量171

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/u013573813/article/details/56666059

版权

leetcode 专栏收录该内容

50 篇文章

订阅专栏

题目

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) {
        if(s.length() != t.length())
            return false;
        HashMap<Character, Integer> map1 = new HashMap<>();
        HashMap<Character, Integer> map2 = new HashMap<>();
        for(int i = 0; i < s.length(); i++){
            // 若两字符对应索引不同（通过Objects.equal()判断，可以比较值和null）
            if(!Objects.equals(map1.get(s.charAt(i)), map2.get(t.charAt(i))))
                return false;
            if(!map1.containsKey(s.charAt(i)) && !map2.containsKey(t.charAt(i))){
                map1.put(s.charAt(i), i);
                map2.put(t.charAt(i), i);
            }
        }
        return true;
    }
}