Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right, and return the reversed list.
Example 1:
Input: head = [1,2,3,4,5], left = 2, right = 4
Output: [1,4,3,2,5]
Explanation: Nodes at positions 2 through 4 (values 2,3,4) are reversed to (4,3,2).
Example 2:
Input: head = [5], left = 1, right = 1
Output: [5]
Explanation: A single node has nothing to reverse.
Example 3:
Input: head = [1,2,3,4,5], left = 1, right = 5
Output: [5,4,3,2,1]
Explanation: Reversing the entire list.
n1 <= n <= 500-500 <= Node.val <= 5001 <= left <= right <= n