Given the head of a **sorted** linked list, delete all duplicates such that each element appears only once. Return the linked list, still sorted.
**Note:** For this problem, linked lists are represented as arrays for simplicity. The function takes the sorted list as an array and should return the deduplicated sorted array.
Example 1
Input:head = [1,1,2]
Output:[1,2]
Example 2
Input:head = [1,1,2,3,3]
Output:[1,2,3]
Example 3
Input:head = []
Output:[]
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.