一刷205

Author: diguage

README.adoc

@@ -1461,12 +1461,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Easy
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/isomorphic-strings/[205. Isomorphic Strings^]
-//|{source_base_url}/_0205_IsomorphicStrings.java[Java]
-//|{doc_base_url}/0205-isomorphic-strings.adoc[题解]
-//|Easy
-//|
+|{counter:codes}
+|{leetcode_base_url}/isomorphic-strings/[205. Isomorphic Strings^]
+|{source_base_url}/_0205_IsomorphicStrings.java[Java]
+|{doc_base_url}/0205-isomorphic-strings.adoc[题解]
+|Easy
+|
 
 |{counter:codes}
 |{leetcode_base_url}/reverse-linked-list/[206. Reverse Linked List^]

docs/0205-isomorphic-strings.adoc

@@ -39,11 +39,36 @@ All occurrences of a character must be replaced with another character while pre
 
 You may assume both *_s _*and *_t _*have the same length.
 
+== 思路分析
 
+image::images/0205-01.png[{image_attr}]
+
+检查是否为一一映射。
 
 [[src-0205]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0205_IsomorphicStrings.java[tag=answer]
 ----
-
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0205_IsomorphicStrings_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/isomorphic-strings/solutions/536521/tong-gou-zi-fu-chuan-by-leetcode-solutio-s6fd/?envType=study-plan-v2&envId=selected-coding-interview[205. 同构字符串 - 官方题解^]
+. https://leetcode.cn/problems/isomorphic-strings/solutions/1645867/by-jyd-i4wt/?envType=study-plan-v2&envId=selected-coding-interview[205. 同构字符串 - 哈希表，清晰图解^]
+. https://leetcode.cn/problems/isomorphic-strings/solutions/536884/suo-yin-yuan-zu-dan-shuang-ha-xi-biao-5j-mxra/?envType=study-plan-v2&envId=selected-coding-interview[205. 同构字符串 - 索引 + 元组 + 单双哈希表（5解法，超99%）^]

docs/images/0205-01.png

@@ -484,7 +484,7 @@ include::0202-happy-number.adoc[leveloffset=+1]
 
 include::0204-count-primes.adoc[leveloffset=+1]
 
-// include::0205-isomorphic-strings.adoc[leveloffset=+1]
+include::0205-isomorphic-strings.adoc[leveloffset=+1]
 
 include::0206-reverse-linked-list.adoc[leveloffset=+1]
 

docs/index.adoc

@@ -610,6 +610,11 @@
 |{doc_base_url}/0232-implement-queue-using-stacks.adoc[题解]
 |❎
 
+|{counter:codes}
+|{leetcode_base_url}/isomorphic-strings/[205. Isomorphic Strings^]
+|{doc_base_url}/0205-isomorphic-strings.adoc[题解]
+|❎哈希映射
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

logbook/202406.adoc

@@ -22,11 +22,14 @@
  * @since 2020-01-10 23:04
  */
 public class _0204_CountPrimes {
-  // tag::answer[]
+    // tag::answer[]
     /**
      * Runtime: 163 ms, faster than 25.96% of Java online submissions for Count Primes.
      *
      * Memory Usage: 93.7 MB, less than 5.66% of Java online submissions for Count Primes.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-10 23:04
      */
     public int countPrimes(int n) {
         if (n < 3) {

src/main/java/com/diguage/algo/leetcode/_0204_CountPrimes.java

@@ -0,0 +1,32 @@
+package com.diguage.algo.leetcode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _0205_IsomorphicStrings {
+  // tag::answer[]
+  /**
+   * @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;
+  }
+  // end::answer[]
+}