leetcode

0 class Solution {

1 public:

2 ListNode *reverseBetween(ListNode *head, int left, int right) {

3 ListNode top;

4 top.next = head;

5 ListNode *prev = ⊤

6

7 for (int i = 1; i < left; i++)

8 prev = prev->next;

9

10 ListNode *crnt = prev->next;

11 for (int i = 0; i < right - left; i++) {

12 ListNode *tmp = prev->next;

13 prev->next = crnt->next;

14 crnt->next = crnt->next->next;

15 prev->next->next = tmp;

16 }

17

18 return top.next;

19 }

20 };