205 - Isomorphic Strings

最新推荐文章于 2020-12-29 22:18:45 发布

绿水兰田

最新推荐文章于 2020-12-29 22:18:45 发布

阅读量205

点赞数 1

分类专栏： leetcode 文章标签： leetcode 算法

本文链接：https://blog.csdn.net/LvShuiLanTian/article/details/96131514

版权

leetcode 专栏收录该内容

83 篇文章 1 订阅

订阅专栏

Problem

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.

Code

public class Solution {
    public boolean isIsomorphic(String s, String t) {
        return check(s, t) && check(t, s);
    }
    
    private boolean check(String s, String t) {
        if (s.length() != t.length()) {
            return false;
        }
        Map<Character, Character> map = new HashMap<Character, Character>();
        for (int i = 0; i < s.length(); ++i) {
            char ch = s.charAt(i);
            if (map.get(ch) == null) {
                map.put(ch, t.charAt(i));
            }
            if (map.get(ch) != t.charAt(i)) {
                return false;
            }
        }
        return true;
    }
}