JuniorLinked List
Remove Duplicates from Sorted List
Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Example 1
[1] -> [1] -> [2] -> null --- [1] -> [2] -> null
Input
head = [1,1,2]Output
[1,2]The duplicate value 1 is removed, leaving one occurrence of each value.
Example 2
[1] -> [1] -> [2] -> [3] -> [3] -> null --- [1] -> [2] -> [3] -> null
Input
head = [1,1,2,3,3]Output
[1,2,3]The extra 1 and 3 nodes are removed so every value appears once.
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