92. Reverse Linked List IIMedium
Given the
head
of a singly linked list and two integersleft
andright
whereleft <= right
, reverse the nodes of the list from positionleft
to positionright
, and return the reversed list.
- Problem
- Solutions
Given the
head
of a singly linked list and two integersleft
andright
whereleft <= right
, reverse the nodes of the list from positionleft
to positionright
, and return the reversed list.