Given the head of a linked list, remove the n-th node **from the end** of the list and return its head.
**Note:** For this problem, linked lists are represented as arrays for simplicity. The function takes the list as an array and should return the resulting list as an array.
**Follow-up:** on a real singly linked list, could you do this in one pass without knowing the length in advance?
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.
Example 2
Input:head = [1], n = 1
Output:[]
Example 3
Input:head = [1,2], n = 1
Output:[1]
Constraints
- The number of nodes in the list is sz.
- 1 <= sz <= 30
- 0 <= Node.val <= 100
- 1 <= n <= sz