Isomorphic Strings

最新推荐文章于 2020-08-15 09:48:30 发布

最新推荐文章于 2020-08-15 09:48:30 发布 · 87 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文探讨了如何通过字符映射的方法来判断两个字符串是否等价，即一个字符串中的每个字符能否通过某种规则对应到另一个字符串中的字符，同时保持原始顺序不变。以egg与add为例，展示了实现这一过程的步骤和逻辑。

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,Character> hashMapS = new HashMap<>();
        HashMap<Character,Character> hashMapT = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
			if (hashMapS.containsKey(s.charAt(i))) {
				if (hashMapS.get(s.charAt(i)) != t.charAt(i)) {
					return false;
				}
			} else {
				if (hashMapT.containsKey(t.charAt(i))) {
					return false;
				}
				hashMapS.put(s.charAt(i), t.charAt(i));
				hashMapT.put(t.charAt(i), s.charAt(i));
			}
		}
		return true;
    }
}