Leetcode 题目解析之 Isomorphic Strings
原创Leetcode 题目解析之 Isomorphic Strings
原创
ruochen
发布于 2022-01-10 20:21:16
发布于 2022-01-10 20:21:16
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.
保证一对一的映射关系，即字母e映射了a，则不能再表示自身
public boolean isIsomorphic(String s, String t) {
if (s == null || t == null) {
return false;
}
if (s.length() != t.length()) {
return false;
}
Map<Character, Character> map = new HashMap<Character, Character>();
Set<Character> set = new HashSet<Character>();
for (int i = 0; i < s.length(); i++) {
char c1 = s.charAt(i);
char c2 = t.charAt(i);
// 保证一对一的映射关系
if (map.containsKey(c1)) {
if (map.get(c1) != c2) {
return false;
}
} else {
if (set.contains(c2)) {
return false;
}
map.put(c1, c2);
set.add(c2);
}
}
return true;
}原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。
如有侵权，请联系 cloudcommunity@tencent.com 删除。
原创声明：本文系作者授权腾讯云开发者社区发表，未经许可，不得转载。
如有侵权，请联系 cloudcommunity@tencent.com 删除。
评论
登录后参与评论
推荐阅读