-
Notifications
You must be signed in to change notification settings - Fork 0
/
reversenodeinkgroup.cpp
81 lines (62 loc) · 1.86 KB
/
reversenodeinkgroup.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *reverseKGroup(ListNode *head, int k) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
ListNode * save = head;
ListNode * pre = new ListNode(0);
ListNode * left ;
ListNode * leftsave;
ListNode * rightsave;
ListNode * right ;
ListNode * root = head;
if(k == 1)
return head;
for(int t = 0; ; t++){
int i = 1;
while(i <= k){
if(root == NULL)
break;
if(i == 1){
left = root;
}
else if(i == k){
right = root;
break;
}
i++;
root = root->next;
}
if(root == NULL)
break;
leftsave = left;
rightsave = right->next;
pre->next = right;
ListNode * leftnext = left->next;
ListNode * temp;
i = k-1;
while(i > 0){
if(leftnext != NULL)
temp = leftnext->next;
leftnext->next = left;
left = leftnext;
leftnext = temp;
i--;
}
leftsave->next = rightsave;
if(t == 0)
save = pre->next;
pre = leftsave;
root = rightsave;
}
return save;
}
};