Coding Trainer

Remove Duplicates from Sorted List II

MediumFast & Slow Pointersk-linked-list

Problem

Remove Duplicates from Sorted List II

Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers. Return the list sorted.

Example 1:

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

Example 2:

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

Constraints:

  • Number of nodes: 0–300
  • -100 <= Node.val <= 100
  • List is sorted in ascending order