Question
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.
Note:
You may assume both s and t have the same length.
本题难度Easy。
哈希法
复杂度
时间 O(N) 空间 O(N)
思路
用一个哈希表记录字符串s中字母到字符串t中字母的映射关系,一个集合记录已经映射过的字母(或者用两个哈希表记录双向的映射关系)这里不能只用一个哈希表,因为要排除egg->ddd这种多对一的映射。
代码
参考
[Leetcode] Isomorphic Strings 同构字符串