三刷82

Author: diguage

docs/0000-07-fast-slow-pointers.adoc

@@ -24,6 +24,7 @@ Middle of the LinkedList (easy)
 
 == 经典题目
 
+. xref:0082-remove-duplicates-from-sorted-list-ii.adoc[82. Remove Duplicates from Sorted List II]
 . xref:0141-linked-list-cycle.adoc[141. Linked List Cycle]
 . xref:0142-linked-list-cycle-ii.adoc[142. Linked List Cycle II]
 . xref:0143-reorder-list.adoc[143. Reorder List]

docs/0082-remove-duplicates-from-sorted-list-ii.adoc

@@ -1,38 +1,73 @@
 [#0082-remove-duplicates-from-sorted-list-ii]
-= 82. Remove Duplicates from Sorted List II
+= 82. 删除排序链表中的重复元素 II
 
-{leetcode}/problems/remove-duplicates-from-sorted-list-ii/[LeetCode - Remove Duplicates from Sorted List II^]
+https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/[LeetCode - 82. 删除排序链表中的重复元素 II ^]
 
-Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
+给定一个已排序的链表的头 `head`， _删除原始链表中所有重复数字的节点，只留下不同的数字_ 。返回 _已排序的链表_。
 
-.Example 1:
-----
-Input: 1->2->3->3->4->4->5
-Output: 1->2->5
-----
 
-.Example 2:
-----
-Input: 1->1->1->2->3
-Output: 2->3
-----
+*示例 1：*
+
+image::images/0082-01.jpg[{image_attr}]
+
+....
+输入：head = [1,2,3,3,4,4,5]
+输出：[1,2,5]
+....
+
+*示例 2：*
+
+image::images/0082-02.jpg[{image_attr}]
+
+....
+输入：head = [1,1,1,2,3]
+输出：[2,3]
+....
 
-== 解题分析
+*提示：*
+
+* 链表中节点数目在范围 `[0, 300]` 内
+* `+-100 <= Node.val <= 100+`
+* 题目数据保证链表已经按升序 *排列*
+
+
+== 思路分析
 
 快慢指针是个好办法！
 
 注意推敲满指针前进的条件！
 
 [[src-0082]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0082_RemoveDuplicatesFromSortedListII.java[tag=answer]
 ----
+--
 
+二刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0082_RemoveDuplicatesFromSortedListII_2.java[tag=answer]
 ----
+--
+
+三刷::
++
+--
+[{java_src_attr}]
+----
+include::{sourcedir}/_0082_RemoveDuplicatesFromSortedListIi_3.java[tag=answer]
+----
+--
+====
+
 
 == 参考资料
 

docs/images/0082-01.jpg

@@ -733,6 +733,11 @@ endif::[]
 |{doc_base_url}/0055-jump-game.adoc[题解]
 |✅ 贪心算法。没想到这就是贪心？
 
+|{counter:codes2503}
+|{leetcode_base_url}/remove-duplicates-from-sorted-list-ii/[82. 删除排序链表中的重复元素 II^]
+|{doc_base_url}/0082-remove-duplicates-from-sorted-list-ii.adoc[题解]
+|✅ 快慢指针。
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

docs/images/0082-02.jpg

@@ -15,6 +15,9 @@ public class _0082_RemoveDuplicatesFromSortedListII_2 {
 
   /**
    * 参考官方题解
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-07-03 16:50:50
    */
   public ListNode deleteDuplicates(ListNode head) {
     if (head == null || head.next == null) {

logbook/202503.adoc

@@ -0,0 +1,51 @@
+package com.diguage.algo.leetcode;
+
+import com.diguage.algo.util.ListNode;
+import com.diguage.util.ListNodes;
+
+import java.util.Arrays;
+
+public class _0082_RemoveDuplicatesFromSortedListIi_3 {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-05-20 14:39:15
+   */
+  public ListNode deleteDuplicates(ListNode head) {
+    ListNode dummy = new ListNode(101);
+    dummy.next = head;
+    ListNode pre = dummy;
+    ListNode slow = head;
+    ListNode fast = head;
+    boolean flag = false;
+    while (fast != null) {
+      if (fast.val == slow.val) {
+        if (fast != slow) {
+          flag = true;
+        }
+        fast = fast.next;
+      } else {
+        if (flag) {
+          pre.next = fast;
+          slow = fast;
+          flag = false;
+        } else {
+          pre = pre.next;
+          slow = slow.next;
+          fast = fast.next;
+        }
+      }
+    }
+    if (flag) {
+      pre.next = fast;
+    }
+    return dummy.next;
+  }
+  // end::answer[]
+
+  public static void main(String[] args) {
+    new _0082_RemoveDuplicatesFromSortedListIi_3()
+      .deleteDuplicates(ListNodes.build(Arrays.asList(1, 1)));
+  }
+}