Given the head of a sorted linked list, delete all duplicates such that each element appears only once.
Example 1:
Input: head = [1, 1, 2]
Output: [1, 2]
Example 2:
Input: head = [1, 1, 2, 3, 3]
Output: [1, 2, 3]
linked-listTime: O(n)Space: O(1)Frequency: 5
Given the head of a sorted linked list, delete all duplicates such that each element appears only once.
Example 1:
Input: head = [1, 1, 2]
Output: [1, 2]
Example 2:
Input: head = [1, 1, 2, 3, 3]
Output: [1, 2, 3]
sorting