> For the complete documentation index, see [llms.txt](https://jaywin.gitbook.io/leetcode/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://jaywin.gitbook.io/leetcode/solutions/0082-remove-duplicates-from-sorted-list-ii.md).

# 0082. Remove Duplicates from Sorted List II

<https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii>

## Description

Given the `head` of a sorted linked list, *delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list*. Return *the linked list **sorted** as well*.

**Example 1:**

![](https://assets.leetcode.com/uploads/2021/01/04/linkedlist1.jpg)

```
**Input:** head = [1,2,3,3,4,4,5]
**Output:** [1,2,5]
```

**Example 2:**

![](https://assets.leetcode.com/uploads/2021/01/04/linkedlist2.jpg)

```
**Input:** head = [1,1,1,2,3]
**Output:** [2,3]
```

**Constraints:**

* The number of nodes in the list is in the range `[0, 300]`.
* `-100 <= Node.val <= 100`
* The list is guaranteed to be **sorted** in ascending order.

## ac

```java
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */

// Key point is: discuss 2 situation separately, duplicate or not.
class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        // edge case
        if (head == null || head.next == null) return head;

        // dummy
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        ListNode h = head, t = dummy;

        // walk
        while (h != null) {
            if (h.next != null && h.next.val == h.val) {
                while (h.next != null && h.next.val == h.val) h.next = h.next.next;
                t.next = h.next;
            } else {
                t = t.next;
            }
            h = h.next;
        }

        return dummy.next;
    }
}
```


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter, and the optional `goal` query parameter:

```
GET https://jaywin.gitbook.io/leetcode/solutions/0082-remove-duplicates-from-sorted-list-ii.md?ask=<question>&goal=<endgoal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is optional and describes the broader end goal you are ultimately trying to accomplish on behalf of the user. GitBook uses it to tailor the answer towards what is most useful for that goal.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.