Skip to content

Commit bb64eb9

Browse files
committed
Update reverse-nodes-in-k-group.cpp
1 parent 9eda491 commit bb64eb9

File tree

1 file changed

+13
-13
lines changed

1 file changed

+13
-13
lines changed

C++/reverse-nodes-in-k-group.cpp

Lines changed: 13 additions & 13 deletions
Original file line numberDiff line numberDiff line change
@@ -14,32 +14,32 @@ class Solution {
1414
ListNode* reverseKGroup(ListNode* head, int k) {
1515
ListNode dummy{0};
1616
dummy.next = head;
17-
ListNode *cur = head, *cur_dummy = &dummy;
17+
auto curr = head, curr_dummy = &dummy;
1818
int len = 0;
1919

20-
while (cur) {
21-
ListNode *next_cur = cur->next;
20+
while (curr) {
21+
auto next_curr = curr->next;
2222
len = (len + 1) % k;
2323

2424
if (len == 0) {
25-
ListNode *next_dummy = cur_dummy->next;
26-
reverse(&cur_dummy, cur->next);
27-
cur_dummy = next_dummy;
25+
auto next_dummy = curr_dummy->next;
26+
reverse(&curr_dummy, curr->next);
27+
curr_dummy = next_dummy;
2828
}
29-
cur = next_cur;
29+
curr = next_curr;
3030
}
3131
return dummy.next;
3232
}
3333

3434
void reverse(ListNode **begin, const ListNode *end) {
3535
ListNode *first = (*begin)->next;
36-
ListNode *cur = first->next;
36+
ListNode *curr = first->next;
3737

38-
while (cur != end) {
39-
first->next = cur->next;
40-
cur->next = (*begin)->next;
41-
(*begin)->next = cur;
42-
cur = first->next;
38+
while (curr != end) {
39+
first->next = curr->next;
40+
curr->next = (*begin)->next;
41+
(*begin)->next = curr;
42+
curr = first->next;
4343
}
4444
}
4545
};

0 commit comments

Comments
 (0)