友情支持
如果您觉得这个笔记对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜
|
|
有些打赏的朋友希望可以加个好友，欢迎关注D 瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。
公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。 如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。 |
205. Isomorphic Strings
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 =t ="egg","add" Output: true
Example 2:
Input: s =t ="foo","bar" Output: false
Example 3:
Input: s =t ="paper","title" Output: true
Note:
You may assume both *_s _*and *_t _*have the same length.
思路分析
检查是否为一一映射。
-
一刷
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
/**
* @author D瓜哥 · https://www.diguage.com
* @since 2024-09-15 22:54:57
*/
public boolean isIsomorphic(String s, String t) {
Map<Character, Character> s2t = new HashMap<>();
Map<Character, Character> t2s = new HashMap<>();
for (int i = 0; i < s.length(); i++) {
char sc = s.charAt(i);
char tc = t.charAt(i);
if (s2t.containsKey(sc) && s2t.get(sc) != tc) {
return false;
} else {
s2t.put(sc, tc);
}
if (t2s.containsKey(tc) && t2s.get(tc) != sc) {
return false;
} else {
t2s.put(tc, sc);
}
}
return true;
}