-
Notifications
You must be signed in to change notification settings - Fork 0
/
Leetcode0092.cpp
35 lines (34 loc) · 1017 Bytes
/
Leetcode0092.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* reverseBetween(ListNode* head, int left, int right) {
ListNode* dummy = new ListNode(-1), *last = NULL, *p;
dummy -> next = head;
p = dummy;
int cnt = 0;
while (p) {
last = p;
p = p -> next;
cnt++;
if (cnt == left) {
ListNode* cur = p, *q = p -> next;
for (int j = 0; j < right - left; j++) {
p -> next = q -> next;
q -> next = last -> next;
last -> next = q;
q = p -> next;
}
}
}
return dummy -> next;
}
};