Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.
You may not alter the values in the nodes, only nodes itself may be changed.
Only constant memory is allowed.
For example,
Given this linked list: 1->2->3->4->5
For k = 2, you should return: 2->1->4->3->5
For k = 3, you should return: 3->2->1->4->5
class Solution {
public:
/*
** 指向单链表的第K个结点, 若长度不足K则返回NULL
** 1->2->3, 2 返回指向2的指针
*/
ListNode* pnt_BK ( ListNode* head, int k ) {
ListNode* ptr = head;
int i = 0;
while ( ptr && i++ < k - 1 ) {
ptr = ptr->next;
}
return ptr;
}
ListNode* reverse ( ListNode* head, int k ) {
if ( head == NULL ) { return NULL; }
/* 判断是否足够长度,若不够长度直接返回头指针不reverse */
ListNode* ptr = pnt_K ( head, k );
if ( ptr == NULL ) { return head; }
ptr = head;
ListNode* p = head, *q = head->next, *r = NULL;
int count = k;
while ( q && count-- > 1 ){
r = q->next;
q->next = p;
p = q;
q = r;
}
ptr->next = reverse( q, k );
return p;
}
/* 连续K个元素翻转,不足K则不翻转 */
ListNode *reverseKGroup(ListNode *head, int k) {
if ( head == NULL || k <= 0 ){
return head;
}
return reverse( head, k );
}
};