二刷237

Author: diguage

docs/0237-delete-node-in-a-linked-list.adoc

@@ -3,23 +3,11 @@
 
 {leetcode}/problems/delete-node-in-a-linked-list/[LeetCode - Delete Node in a Linked List^]
 
-这个题其实很简单！把节点的值覆盖当前节点的值即可。
-
-没想到打脸如此之快！还有更简单的办法，两行代码搞定：①把下一个节点的值拷贝到当前节点；②把当前节点的下一节点指向下下一个节点即可。
-
-image::images/0237-0.png[{image_attr}]
-
-image::images/0237-1.png[{image_attr}]
-
-image::images/0237-2.png[{image_attr}]
-
 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
 
 Given linked list -- head = [4,5,1,9], which looks like following:
 
-image::https://assets.leetcode.com/uploads/2018/12/28/237_example.png[{image_attr}]
-
- 
+image::images/0237-00.png[{image_attr}]
 
 *Example 1:*
 
@@ -50,11 +38,37 @@ image::https://assets.leetcode.com/uploads/2018/12/28/237_example.png[{image_att
 * Do not return anything from your function.
 
 
+== 思路分析
 
+这个题其实很简单！把节点的值覆盖当前节点的值即可。
+
+没想到打脸如此之快！还有更简单的办法，两行代码搞定：①把下一个节点的值拷贝到当前节点；②把当前节点的下一节点指向下下一个节点即可。
+
+image::images/0237-01.png[{image_attr}]
 
 [[src-0237]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0237_DeleteNodeInALinkedList.java[tag=answer]
 ----
+--
+
+二刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0237_DeleteNodeInALinkedList_2.java[tag=answer]
+----
+--
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/delete-node-in-a-linked-list/solutions/2362069/237-shan-chu-lian-biao-zhong-de-jie-dian-zli2/?envType=study-plan-v2&envId=selected-coding-interview[237. 删除链表中的节点 - 清晰图解^]
 

docs/images/0237-0.png renamed to docs/images/0237-00.png

@@ -665,6 +665,11 @@
 |{doc_base_url}/0089-gray-code.adoc[题解]
 |❌位运算
 
+|{counter:codes}
+|{leetcode_base_url}/delete-node-in-a-linked-list/[237. Delete Node in a Linked List^]
+|{doc_base_url}/0237-delete-node-in-a-linked-list.adoc[题解]
+|⭕️解法很巧妙，只需要拷贝一个值，修改一个指针即可。
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

docs/images/0237-01.png

@@ -42,14 +42,17 @@
  * @since 2020-01-13 20:28
  */
 public class _0237_DeleteNodeInALinkedList {
-  // tag::answer[]
+    // tag::answer[]
 
     /**
      * Runtime: 0 ms, faster than 100.00% of Java online submissions for Delete Node in a Linked List.
      *
      * Memory Usage: 36.2 MB, less than 100.00% of Java online submissions for Delete Node in a Linked List.
      *
      * Copy from: https://leetcode.com/problems/delete-node-in-a-linked-list/solution/[Delete Node in a Linked List solution - LeetCode]
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-13 20:28
      */
     public void deleteNode(ListNode node) {
         node.val = node.next.val;

docs/images/0237-1.png

@@ -0,0 +1,18 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.ListNode;
+
+public class _0237_DeleteNodeInALinkedList_2 {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-16 20:54:33
+   */
+  public void deleteNode(ListNode node) {
+    // 把后面一个元素拷贝过来
+    node.val = node.next.val;
+    // 把当前元素的下节点指针指向下下节点
+    node.next = node.next.next;
+  }
+  // end::answer[]
+}