Given the head of a linked list, remove the nth node from the end of the list and return its head.
Example 1:
Input: head = [1,2,3,4,5], n = 2
Output: [1,2,3,5]
Explanation: The 2nd node from the end is 4. After removing it, the list becomes [1,2,3,5].
Example 2:
Input: head = [1], n = 1
Output: []
Explanation: The only node is removed, resulting in an empty list.
Example 3:
Input: head = [1,2], n = 1
Output: [1]
Explanation: The last node is removed, leaving [1].
sz1 <= sz <= 300 <= Node.val <= 1001 <= n <= sz