Remove Duplicates from Sorted List

Intuition

Since the list is sorted, every group of equal values sits together as a contiguous run. That means detecting a duplicate is purely local: if a node has the same value as the node directly after it, the successor is redundant. We keep one pointer at the current node and peek at its next node. When they match, we bypass the successor by pointing current.next past it; otherwise the current node is the last of its value group and we move forward. We only advance the pointer when we did not delete, so a run of three or more equal values collapses correctly in a single pass.

Algorithm walkthrough

1. 1Start with a pointer curr at the head of the list.
2. 2Loop while curr is not null and curr.next is not null.
3. 3If curr.val equals curr.next.val, splice out the duplicate by setting curr.next to curr.next.next.
4. 4Otherwise, the values differ, so advance curr to curr.next.
5. 5Do not advance curr after a deletion, so consecutive duplicates are all removed.
6. 6Return the original head, which still points at the first node.

Implementation

class Solution:
    def deleteDuplicates(self, head: Optional[ListNode]) -> Optional[ListNode]:
        current = head
        while current and current.next:
            if current.val == current.next.val:
                current.next = current.next.next
            else:
                current = current.next
        return head