二刷138

Author: diguage

docs/0000-00-note.adoc

@@ -24,6 +24,7 @@ image::images/quick-sort-01.gif[{image_attr}]
 * [ ] https://leetcode.cn/problems/number-of-islands/solutions/211211/dao-yu-lei-wen-ti-de-tong-yong-jie-fa-dfs-bian-li-/[200. 岛屿数量 - 岛屿类问题的通用解法、DFS 遍历框架^]
 * [ ] 魔改的二分查找
 * [ ] 买卖股票
+* [ ] 链表复制相关操作，也可以将新旧节点交替相连来处理。
 
 == 解题范式
 

docs/0138-copy-list-with-random-pointer.adoc

@@ -58,21 +58,43 @@ image::images/0138-copy-list-with-random-pointer-example-3.png[{image_attr}]
 * `Node.random` is null or pointing to a node in the linked list.
 * Number of Nodes will not exceed 1000.
 
-== 解题分析
+== 思路分析
 
-这道题可以使用类似 xref:133. Clone Graph[133. Clone Graph] 的解法来求解。
+这道题可以使用类似 xref:0133-clone-graph.adoc[133. Clone Graph] 的解法来求解。
 
 video::OvpKeraoxW0[youtube]
 
 image::images/0138-copy-list-with-random-pointer.jpg[{image_attr}]
 
-这个解法非常精妙！
+image::images/0138-02.png[{image_attr}]
+
+新旧节点相连的解法非常精妙！
 
 使用 `Map` 的解法也好巧妙啊！
 
 [[src-0138]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0138_CopyListWithRandomPointer.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0138_CopyListWithRandomPointer_2.java[tag=answer]
+----
+--
+====
+
+== 参考资料
 
+. https://leetcode.cn/problems/copy-list-with-random-pointer/solutions/2361362/138-fu-zhi-dai-sui-ji-zhi-zhen-de-lian-b-6jeo/?envType=study-plan-v2&envId=selected-coding-interview[138. 随机链表的复制 - 清晰图解^]
+. https://leetcode.cn/problems/copy-list-with-random-pointer/solutions/889166/fu-zhi-dai-sui-ji-zhi-zhen-de-lian-biao-rblsf/?envType=study-plan-v2&envId=selected-coding-interview[138. 随机链表的复制 - 官方题解^]

docs/images/0138-02.png

@@ -732,6 +732,11 @@
 |{doc_base_url}/1823-find-the-winner-of-the-circular-game.adoc[题解]
 |❌ 约瑟夫环，使用队列出队入队来模拟计数，出队表示删除。妙！
 
+|{counter:codes}
+|{leetcode_base_url}/copy-list-with-random-pointer/[138. Copy List with Random Pointer^]
+|{doc_base_url}/0138-copy-list-with-random-pointer.adoc[题解]
+|✅ 哈希或者链表新旧交替相连
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

logbook/202406.adoc

@@ -57,14 +57,17 @@
  * @since 2020-01-07 22:21
  */
 public class _0138_CopyListWithRandomPointer {
-  // tag::answer[]
+    // tag::answer[]
 
     /**
      * Runtime: 0 ms, faster than 100.00% of Java online submissions for Copy List with Random Pointer.
      *
      * Memory Usage: 40.6 MB, less than 5.61% of Java online submissions for Copy List with Random Pointer.
      *
      * Copy from: https://leetcode.com/problems/copy-list-with-random-pointer/discuss/43488/Java-O(n)-solution[Java O(n) solution - LeetCode Discuss]
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-07 22:21
      */
     public Node copyRandomList(Node head) {
         if (Objects.isNull(head)) {
@@ -182,7 +185,7 @@ public static Node build(Integer[][] array) {
         return restult;
     }
 
-    static class Node {
+    public static class Node {
         int val;
         Node next;
         Node random;

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

@@ -0,0 +1,45 @@
+package com.diguage.algo.leetcode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import static com.diguage.algo.leetcode._0138_CopyListWithRandomPointer.Node;
+
+public class _0138_CopyListWithRandomPointer_2 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-19 15:56:51
+   */
+  public Node copyRandomList(Node head) {
+    if (head == null) {
+      return null;
+    }
+    Map<Node, Node> nodeToRandomMap = new HashMap<>();
+    Map<Node, Node> oldToNewMap = new HashMap<>();
+    Node dummy = new Node(0);
+    Node curr = head;
+    Node tail = dummy;
+    while (curr != null) {
+      Node newNode = new Node(curr.val);
+      oldToNewMap.put(curr, newNode);
+      if (curr.random != null) {
+        nodeToRandomMap.put(curr, curr.random);
+      }
+      tail.next = newNode;
+      tail = newNode;
+      curr = curr.next;
+    }
+    curr = head;
+    while (curr != null) {
+      if (curr.random != null) {
+        Node newNode = oldToNewMap.get(curr);
+        newNode.random = oldToNewMap.get(nodeToRandomMap.get(curr));
+      }
+      curr = curr.next;
+    }
+    return dummy.next;
+  }
+  // end::answer[]
+}