head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.
Input: head = [1,1,2]
Input: head = [1,1,2,3,3]
- The number of nodes in the list is in the range
-100 <= Node.val <= 100
- The list is guaranteed to be sorted in ascending order.