Given the head of a sorted linked list, remove all duplicates such that each element appears only once, and return the list in sorted order.
head
Constraints:
0≤0 \leq0≤ n ≤300\leq 300≤300, where n is the number of nodes in the list.
n
−100≤-100 \leq−100≤ Node.value ...
Node.value