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.
用两个HashMap维护字符的映射关系,时间复杂度 O(n) ,空间复杂度 O(n)
class Solution {
public boolean isIsomorphic(String s, String t) {
if (s.length() != t.length()) {
return false;
}
HashMap<Character, Character> m = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char c1 = s.charAt(i);
char c2 = t.charAt(i);
if (m.containsKey(c1)) {
if (m.get(c1) == c2) {
continue;
} else {
return false;
}
} else {
if (!m.containsValue(c2)) {
m.put(c1, c2);
} else {
return false;
}
}
}
return true;
}
}